Reversal on regular languages and descriptional complexity

DOI10.1007/978-3-642-39310-5_25MaRDI QIDQ2843102zbMATH OpenOpenAlexFDO

Authors Juraj Šebej

Publication date 9 August 2013

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-39310-5_25

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On the state complexity of reversals of regular languages
• Note on reversal of binary regular languages
• Reversal of binary regular languages
• On the State Complexity of Complements, Stars, and Reversals of Regular Languages
• The ranges of state complexities for complement, star, and reversal of regular languages

Cited in

(12)

• The Complexity of Languages Resulting from the Concatenation Operation
• On the state complexity of the reverse of \({\mathcal R}\)- and \({\mathcal J}\)-trivial regular languages
• Reversal of binary regular languages
• Descriptional complexity of two-way pushdown automata with restricted head reversals
• scientific article; zbMATH DE number 7444007 (Why is no real title available?)
• The ranges of state complexities for complement, star, and reversal of regular languages
• Note on reversal of binary regular languages
• The ranges of accepting state complexities of languages resulting from some operations
• Complexity of bifix-free regular languages
• Complexity of bifix-free regular languages
• On the state complexity of reversals of regular languages
• The ranges of state and accepting state complexities for the cut operation

This page was built for publication: Reversal on regular languages and descriptional complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2843102)