The state complexities of some basic operations on regular languages
Theoretical Computer Science
Handbook of formal languages, vol. 1
State complexity of regular languages
Journal of Automata, Languages and Combinatorics
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Tight lower bound for the state complexity of shuffle of regular languages
Journal of Automata, Languages and Combinatorics
State complexity of proportional removals
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
On the state complexity of reversals of regular languages
Theoretical Computer Science
State complexity of some operations on binary regular languages
Theoretical Computer Science - Descriptional complexity of formal systems
State complexity of combined operations
Theoretical Computer Science
The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal
Fundamenta Informaticae
State complexity of basic language operations combined with reversal
Information and Computation
Theoretical Computer Science
Determination of finite automata accepting subregular languages
Theoretical Computer Science
Estimation of state complexity of combined operations
Theoretical Computer Science
State complexity of basic operations on nondeterministic finite automata
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Undecidability of the state complexity of composed regular operations
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
State complexity research and approximation
DLT'11 Proceedings of the 15th international conference on Developments in language theory
On the state complexity of combined operations
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
State complexity of star and square of union of k regular languages
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
State Complexity of Combined Operations with Union, Intersection, Star and Reversal
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Sheng Yu (1950-2012) In Memoriam
Fundamenta Informaticae
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
In search of most complex regular languages
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
State complexity of star of union and square of union on k regular languages
Theoretical Computer Science
Universal witnesses for state complexity of basic operations combined with reversal
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Hi-index | 5.23 |
This paper studies the state complexity of (L"1L"2)^R, L"1^RL"2, L"1^*L"2, (L"1@?L"2)L"3, (L"1@?L"2)L"3, L"1L"2@?L"3, and L"1L"2@?L"3 for regular languages L"1, L"2, and L"3. We first show that the upper bound proposed by Liu et al. (2008) [18] for the state complexity of (L"1L"2)^R coincides with the lower bound and is thus the state complexity of this combined operation by providing some witness DFAs. Also, we show that, unlike most other cases, due to the structural properties of the result of the first operation of the combinations L"1^RL"2, L"1^*L"2, and (L"1@?L"2)L"3, the state complexity of each of these combined operations is close to the mathematical composition of the state complexities of the component operations. Moreover, we show that the state complexities of (L"1@?L"2)L"3, L"1L"2@?L"3, and L"1L"2@?L"3 are exactly equal to the mathematical compositions of the state complexities of their component operations in the general cases. We also include a brief survey that summarizes all state complexity results for combined operations with two basic operations.