STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-STAR AND CATENATION-REVERSAL
From MaRDI portal
Publication:2909180
DOI10.1142/S0129054112400047zbMath1279.68144MaRDI QIDQ2909180
Yuan Gao, Bo Cui, Lila Kari, Sheng Yu
Publication date: 30 August 2012
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Related Items
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 ⋮ IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES ⋮ State complexity of union and intersection of square and reversal on \(k\) regular languages
Cites Work
- 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
- State complexity of combined operations
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
- STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
