State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal
From MaRDI portal
Publication:5200089
DOI10.1007/978-3-642-22600-7_13zbMath1341.68091OpenAlexW124365840MaRDI QIDQ5200089
Publication date: 29 July 2011
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-22600-7_13
Related Items (3)
State Complexity of Kleene-Star Operations on Trees ⋮ State complexity of union and intersection of star on \(k\) regular languages ⋮ State complexity of union and intersection of square and reversal on \(k\) regular languages
Cites Work
- On the state complexity of reversals of regular languages
- State complexity of basic language operations combined with reversal
- State complexity of power
- The state complexities of some basic operations on 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
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
- State Complexity of Catenation Combined with Union and Intersection
- STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
- On the State Complexity of Combined Operations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal
