Operational state complexity revisited: the contribution of monsters and modifiers
From MaRDI portal
Publication:6175083
DOI10.1007/978-3-031-34326-1_1OpenAlexW4381855713MaRDI QIDQ6175083FDOQ6175083
Authors: Pascal Caron, Jean-Gabriel Luque, Bruno Patrou 
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
Cites Work
- AUTOMATE, a computing package for automata and finite semigroups
- Title not available (Why is that?)
- The state complexities of some basic operations on regular languages
- On the state complexity of reversals of regular languages
- State complexity of some operations on binary regular languages
- Estimation of state complexity of combined operations
- State complexity of combined operations
- On the state complexity of star of union and star of intersection
- State complexity of two combined operations: catenation-union and catenation-intersection
- The state complexity of two combined operations: star of catenation and star of reversal
- Title not available (Why is that?)
- STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
- Title not available (Why is that?)
- State complexity of basic language operations combined with reversal
- Intersection and union of regular languages and state complexity
- Nondeterminism and the size of two way finite automata
- State complexity of multiple catenations
- In search of most complex regular languages
- A combinatorial approach for the state complexity of the shuffle product
- A survey on operational state complexity
- The exact complexity of star-complement-star
- A general approach to state complexity of operations: formalization and limitations
- New tools for state complexity
- Combination of roots and Boolean operations: an application to state complexity
- State complexity of combined operations involving catenation and binary Boolean operations: beyond the Brzozowski conjectures
- Title not available (Why is that?)
- State complexity of catenation combined with a Boolean operation: a unified approach
- The state complexity of star-complement-star
- A Study of a Simple Class of Modifiers: Product Modifiers
This page was built for publication: Operational state complexity revisited: the contribution of monsters and modifiers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6175083)
