Reversal on Regular Languages and Descriptional Complexity

DOI10.1007/978-3-642-39310-5_25zbMath1388.68179OpenAlexW133066696MaRDI QIDQ2843102

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)

Related Items (4)

Complexity of bifix-free regular languages ⋮ Complexity of bifix-free regular languages ⋮ The Complexity of Languages Resulting from the Concatenation Operation ⋮ The Ranges of Accepting State Complexities of Languages Resulting from Some Operations

This page was built for publication: Reversal on Regular Languages and Descriptional Complexity