Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 1
Pumping-like results for copyless cost register automata and polynomially ambiguous weighted automata
Filip Mazowiecki, Antoni Puch, Daniel Smertnig
Objavljeni znanstveni prispevek na konferenci
Oznake: končni avtomati;linearna rekurzivna zaporedja;weighted automata;cost register automata;ambiguity;linear recurrence sequences;equivalence problem;
In this work we consider two rich subclasses of weighted automata over fields: polynomially ambiguous weighted automata and copyless cost register automata. Primarily we are interested in understanding their expressiveness power. Over the field of rationals and 1-letter alphabets, it is known that t ...
Leto: 2026 Vir: Fakulteta za matematiko in fiziko (UL FMF)
Št. zadetkov: 1
Ključne besede:
Leto izdaje:
Avtorji:
Repozitorij:
Tipologija:
Jezik: