Unambiguous Automata Denoting Finitely Sequential Functions

DOI10.1007/978-3-642-37064-9_11zbMath1377.68103OpenAlexW80475163MaRDI QIDQ4910449

Sebastian Bala, Artur Koniński

Publication date: 18 March 2013

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-37064-9_11

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

Multi-sequential Word Relations ⋮ Multi-Sequential Word Relations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Finite sequentiality of unambiguous max-plus tree automata ⋮ A Pattern Logic for Automata with Outputs

This page was built for publication: Unambiguous Automata Denoting Finitely Sequential Functions