Reversal of binary regular languages

DOI10.1016/j.tcs.2012.05.008zbMath1262.68045OpenAlexW2024077433MaRDI QIDQ443743

Juraj Šebej, Galina Jirásková

Publication date: 13 August 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.05.008

zbMATH Keywords

regular languagesdescriptional complexityreversaldeterministic union-free languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Descriptive complexity and finite models (68Q19)

Related Items (11)

State complexity of combined operations for suffix-free regular languages ⋮ State complexity of inversion operations ⋮ Prefix-free languages: left and right quotient and reversal ⋮ Operational complexity: NFA-to-DFA trade-off ⋮ Operational complexity in subregular classes ⋮ Operations on Boolean and Alternating Finite Automata ⋮ Power, positive closure, and quotients on convex languages ⋮ Most Complex Non-Returning Regular Languages ⋮ Self-Verifying Finite Automata and Descriptional Complexity ⋮ The Ranges of Accepting State Complexities of Languages Resulting from Some Operations ⋮ State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal simulation of self-verifying automata by deterministic automata
• 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

This page was built for publication: Reversal of binary regular languages