State complexity of combined operations with two basic operations
From MaRDI portal
Publication:441851
DOI10.1016/j.tcs.2012.02.030zbMath1276.68091MaRDI QIDQ441851
Bo Cui, Sheng Yu, Yuan Gao, Lila Kari
Publication date: 8 August 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.02.030
68Q45: Formal languages and automata
Related Items
IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES, GOODBY TO THE KINDHEARTED DRAGON PROF. SHENG YU, 1950–2012, State complexity of deletion and bipolar deletion, State complexity of star of union and square of union on \textit{k} regular languages, Some properties of iterated languages, State complexity of combined operations involving catenation and binary Boolean operations: beyond the Brzozowski conjectures, State complexity of permutation on finite languages over a binary alphabet, Undecidability of state complexity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Determination of finite automata accepting subregular 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 Research and Approximation
- STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
- On the State Complexity of Combined Operations
