Note on Reversal of Binary Regular Languages

DOI10.1007/978-3-642-22600-7_17zbMath1341.68097OpenAlexW54863464MaRDI QIDQ5200093

Galina Jirásková, Juraj Šebej

Publication date: 29 July 2011

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22600-7_17

zbMATH Keywords

regular languagesstate complexityreversaldeterministic union-free languagesnondeterministic state complexity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs

Cites Work

• Unnamed Item
• Unnamed Item
• On the state complexity of reversals of regular languages
• Succinct representation of regular languages by Boolean automata
• The state complexities of some basic operations on regular languages
• Quotient complexity of closed languages
• Complementing unary nondeterministic automata
• Quotient Complexity of Ideal Languages
• Complexity in Union-Free Regular Languages