The exact state complexity for the composition of root and reversal

DOI10.1007/978-3-031-33264-7_7OpenAlexW4377081522MaRDI QIDQ6067329

Pascal Caron, Alexandre Durand, Bruno Patrou

Publication date: 16 November 2023

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-33264-7_7

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Classical finite transformation semigroups. An introduction.
• State complexity of basic language operations combined with reversal
• The state complexities of some basic operations on regular languages
• A general approach to state complexity of operations: formalization and limitations
• Combination of roots and Boolean operations: an application to state complexity
• State complexity of combined operations
• On the State Complexity of Star of Union and Star of Intersection
• STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET

This page was built for publication: The exact state complexity for the composition of root and reversal