State complexity of star of union and square of union on \textit{k} regular languages
From MaRDI portal
Publication:391180
DOI10.1016/j.tcs.2013.06.003zbMath1296.68093OpenAlexW2166846151MaRDI QIDQ391180
Publication date: 10 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.06.003
Related Items
Operational State Complexity of Subtree-Free Regular Tree Languages ⋮ State Complexity of Regular Tree Languages for Tree Matching ⋮ State complexity of deletion and bipolar deletion ⋮ State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- State complexity of union and intersection of star on \(k\) regular languages
- State complexity of combined operations with two basic operations
- 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 CONCATENATION AND COMPLEMENTATION
- On the State Complexity of Combined Operations
This page was built for publication: State complexity of star of union and square of union on \textit{k} regular languages
