State complexity of basic language operations combined with reversal
From MaRDI portal
Publication:948089
DOI10.1016/J.IC.2008.03.018zbMATH Open1154.68073OpenAlexW2066620717MaRDI QIDQ948089FDOQ948089
Authors: Guangwu Liu, Arto Salomaa, Carlos Martín-Vide, Sheng Yu 
Publication date: 8 October 2008
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2008.03.018
Recommendations
- State complexity of combined operations with union, intersection, star and reversal
- State complexity of four combined operations composed of union, intersection, star and reversal
- The state complexity of two combined operations: star of catenation and star of reversal
- State complexity of catenation combined with star and reversal
- State complexity of combined operations with two basic operations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The state complexities of some basic operations on regular languages
- State complexity of regular languages
- On the state complexity of reversals of regular languages
- State complexity of combined operations
- ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION
- An introduction to formal languages and automata.
- Multiple-entry finite automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (25)
- 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
- State complexity of combined operations with two basic operations
- State complexity of combined operations with union, intersection, star and reversal
- On the state complexity of reversals of regular languages
- State complexity of power
- State complexity of the concatenation of regular tree languages
- State complexity of union and intersection of square and reversal on \(k\) regular languages
- The state complexity of two combined operations: star of catenation and star of reversal
- State complexity of two combined operations: catenation-union and catenation-intersection
- The range of state complexities of languages resulting from the cut operation
- Operational state complexity revisited: the contribution of monsters and modifiers
- Estimation of state complexity of combined operations
- State complexity of four combined operations composed of union, intersection, star and reversal
- In search of most complex regular languages
- State complexity of inversion operations
- State complexity of two combined operations: catenation-star and catenation-reversal
- State complexity of reversals of deterministic finite automata with output
- Limitations of lower bound methods for deterministic nested word automata
- Universal witnesses for state complexity of basic operations combined with reversal
- The exact state complexity for the composition of root and reversal
- Undecidability of state complexity
- State complexity of catenation combined with union and intersection
- State complexity of inversion operations
- State complexity of catenation combined with a Boolean operation: a unified approach
This page was built for publication: State complexity of basic language operations combined with reversal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q948089)
