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.046zbMATH Open1281.68144OpenAlexW2141385438MaRDI QIDQ714820FDOQ714820
Authors: Yuan Gao, Lila Kari, Sheng Yu 
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
Recommendations
- State complexity of star and square of union of \(k\) regular languages
- State complexity of star of union and square of union on \textit{k} regular languages
- State complexity of combined operations with union, intersection, star and reversal
- State complexity of four combined operations composed of union, intersection, star and reversal
- State complexity of union and intersection of star on \(k\) regular languages
Cites Work
- Title not available (Why is that?)
- The state complexities of some basic operations on regular languages
- State complexity of regular languages
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- State complexity of power
- 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
- 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?)
- Title not available (Why is that?)
- STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
- Title not available (Why is that?)
- The state complexity of \(L^{2}\) and \(L^k\)
- State complexity of basic language operations combined with reversal
- State complexity of four combined operations composed of union, intersection, star and reversal
Cited In (8)
- State complexity of star of union and square of union on \textit{k} regular languages
- State complexity of union and intersection of star on \(k\) regular languages
- On the state complexity of reversals of regular languages
- State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages
- State complexity of star and square of union of \(k\) regular languages
- Operational state complexity of subtree-free regular tree languages
- State complexity of regular tree languages for tree matching
- On the gap between separating words and separating their reversals
This page was built for publication: State complexity of union and intersection of square and reversal on \(k\) regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714820)
