Some results on the structure of unary unambiguous automata

DOI10.1016/j.aam.2010.05.003zbMath1223.68062OpenAlexW1969025852MaRDI QIDQ544137

Marcella Anselmo, Marina Madonia

Publication date: 14 June 2011

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2010.05.003

zbMATH Keywords

ambiguityfinite automatadeterministic finite automaton (DFA)unambiguous finite automaton (UNFA)unary alphabet

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Unambiguous finite automata over a unary alphabet ⋮ Pairs of complementary unary languages with ``balanced nondeterministic automata ⋮ Investigations on Automata and Languages Over a Unary Alphabet

Cites Work

• Complementing unary nondeterministic automata
• A special case of a unary regular language containment
• Roots of unity and covering sets
• Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation
• Pairs of Complementary Unary Languages with “Balanced” Nondeterministic Automata
• THE STRUCTURE AND COMPLEXITY OF MINIMAL NFA’S OVER A UNARY ALPHABET
• Minimal NFA Problems are Hard
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some results on the structure of unary unambiguous automata