Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA

DOI10.1007/978-3-642-15349-5_12zbMath1287.68100OpenAlexW1659549423MaRDI QIDQ3584969

Zdeněk Sawa

Publication date: 31 August 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15349-5_12

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (2)

Deciding determinism of unary languages ⋮ Chrobak Normal Form Revisited, with Applications

Cites Work

• Unnamed Item
• Unary finite automata vs. arithmetic progressions
• Finite automata and unary languages
• On Context-Free Languages

This page was built for publication: Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA