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 Basic Operations on Finite Languages
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
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
Estimation of state complexity of combined operations
Theoretical Computer Science
Finite automata and their decision problems
IBM Journal of Research and Development
The state complexity of L2 and Lk
Information Processing Letters
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
On the state complexity of combined operations
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
State complexity of union and intersection of star on k regular languages
Theoretical Computer Science
State complexity of combined operations with two basic operations
Theoretical Computer Science
On the State Complexity of Star of Union and Star of Intersection
Fundamenta Informaticae
| Hi-index | 5.23 |
In this paper, we investigate the state complexities of (@?"i"="1^kL"i)^@? and (@?"i"="1^kL"i)^2, where L"i, 1==2 are regular languages. We establish exact bounds for both of these general combined operations and show that they are much lower than the mathematical compositions of the state complexities of their basic individual component operations, but have similar forms with the state complexities of some participating combined operations.