STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-UNION AND CATENATION-INTERSECTION
From MaRDI portal
Publication:3224949
DOI10.1142/S0129054111009045zbMath1234.68206OpenAlexW2169267790MaRDI QIDQ3224949
Lila Kari, Yuan Gao, Bo Cui, Sheng Yu
Publication date: 13 March 2012
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054111009045
Related Items
State Complexity of Catenation Combined with a Boolean Operation: A Unified Approach ⋮ 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 ⋮ Operational state complexity revisited: the contribution of monsters and modifiers ⋮ State complexity of combined operations with two basic operations ⋮ Unnamed Item ⋮ STATE COMPLEXITY AND APPROXIMATION ⋮ State complexity of union and intersection of square and reversal on \(k\) regular languages ⋮ Unnamed Item ⋮ State complexity of combined operations involving catenation and binary Boolean operations: beyond the Brzozowski conjectures
Cites Work
- Unnamed Item
- Unnamed Item
- The state complexity of \(L^{2}\) and \(L^k\)
- State complexity of basic language operations combined with reversal
- State complexity of power
- State complexity of basic operations on suffix-free regular languages
- 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
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
- State-complexity of finite-state devices, state compressibility and incompressibility
- STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
- IMPROVED BOUNDS ON THE NUMBER OF AUTOMATA ACCEPTING FINITE LANGUAGES
