Pairs of Complementary Unary Languages with “Balanced” Nondeterministic Automata
From MaRDI portal
Publication:3557021
DOI10.1007/978-3-642-12200-2_19zbMath1283.68195OpenAlexW1607426439WikidataQ61677515 ScholiaQ61677515MaRDI QIDQ3557021
Viliam Geffert, Giovanni Pighizzini
Publication date: 27 April 2010
Published in: LATIN 2010: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-12200-2_19
Related Items
Unambiguous finite automata over a unary alphabet ⋮ Some results on the structure of unary unambiguous automata ⋮ Optimal simulation of self-verifying automata by deterministic automata