Which Finitely Ambiguous Automata Recognize Finitely Sequential Functions?

DOI10.1007/978-3-642-40313-2_10zbMath1398.68295OpenAlexW192303416MaRDI QIDQ2849900

Sebastian Bala

Publication date: 20 September 2013

Published in: Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40313-2_10

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Multi-sequential Word Relations ⋮ Multi-Sequential Word Relations ⋮ Unnamed Item ⋮ Finite sequentiality of unambiguous max-plus tree automata ⋮ Finite ambiguity and finite sequentiality in weighted automata over fields

This page was built for publication: Which Finitely Ambiguous Automata Recognize Finitely Sequential Functions?