Some Minimality Results on Biresidual and Biseparable Automata

DOI10.1007/978-3-642-13089-2_48zbMath1284.68367OpenAlexW1561171389MaRDI QIDQ3564897

Hellis Tamm

Publication date: 26 May 2010

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-13089-2_48

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited ⋮ Descriptional complexity of regular languages

This page was built for publication: Some Minimality Results on Biresidual and Biseparable Automata