Unambiguous Finite Automata over a Unary Alphabet
From MaRDI portal
Publication:3586113
DOI10.1007/978-3-642-15155-2_49zbMath1287.68098OpenAlexW2145466237MaRDI QIDQ3586113
Publication date: 3 September 2010
Published in: Mathematical Foundations of Computer Science 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15155-2_49
Related Items (7)
Descriptional Complexity of Input-Driven Pushdown Automata ⋮ The tractability frontier for NFA minimization ⋮ Unambiguous finite automata over a unary alphabet ⋮ Pairs of complementary unary languages with ``balanced nondeterministic automata ⋮ Lower bounds for the size of deterministic unranked tree automata ⋮ State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet ⋮ Ambiguity of Unary Symmetric Difference NFAs
This page was built for publication: Unambiguous Finite Automata over a Unary Alphabet
