Operational state complexity revisited: the contribution of monsters and modifiers

DOI10.1007/978-3-031-34326-1_1OpenAlexW4381855713MaRDI QIDQ6175083

Bruno Patrou, Pascal Caron, Jean-Gabriel Luque

Publication date: 17 August 2023

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

Full work available at URL: https://doi.org/10.1007/978-3-031-34326-1_1

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the state complexity of reversals of regular languages
• State complexity of basic language operations combined with reversal
• AUTOMATE, a computing package for automata and finite semigroups
• Intersection and union of regular languages and state complexity
• The state complexities of some basic operations on regular languages
• The exact complexity of star-complement-star
• A general approach to state complexity of operations: formalization and limitations
• State complexity of some operations on binary regular languages
• Combination of roots and Boolean operations: an application to state complexity
• Estimation of state complexity of combined operations
• State complexity of combined operations involving catenation and binary Boolean operations: beyond the Brzozowski conjectures
• State complexity of combined operations
• On the State Complexity of Star of Union and Star of Intersection
• The State Complexity of Star-Complement-Star
• State Complexity of Multiple Catenations
• STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-UNION AND CATENATION-INTERSECTION
• A Study of a Simple Class of Modifiers: Product Modifiers
• State Complexity of Catenation Combined with a Boolean Operation: A Unified Approach
• IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES
• Nondeterminism and the size of two way finite automata
• STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION

This page was built for publication: Operational state complexity revisited: the contribution of monsters and modifiers