State complexity of union and intersection of square and reversal on \(k\) regular languages
From MaRDI portal
Publication:714820
DOI10.1016/j.tcs.2012.03.046zbMath1281.68144MaRDI QIDQ714820
Publication date: 11 October 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.03.046
68Q45: Formal languages and automata
Related Items
State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages, Operational State Complexity of Subtree-Free Regular Tree Languages, On the gap between separating words and separating their reversals, State Complexity of Regular Tree Languages for Tree Matching
Cites Work
- The state complexity of \(L^{2}\) and \(L^k\)
- 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
- STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-STAR AND CATENATION-REVERSAL
- Undecidability of the State Complexity of Composed Regular Operations
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
- STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-UNION AND CATENATION-INTERSECTION
- State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal
- STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
