The state complexities of some basic operations on regular languages
Theoretical Computer Science
Handbook of formal languages, vol. 1
NFA to DFA transformation for finite languages over arbitrary alphabets
Journal of Automata, Languages and Combinatorics
State complexity of regular languages
Journal of Automata, Languages and Combinatorics
Universal Algebra and Applications in Theoretical Computer Science
Universal Algebra and Applications in Theoretical Computer Science
Theory of Automata
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
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
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
Unary language operations and their nondeterministic state complexity
DLT'02 Proceedings of the 6th 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 basic operations on suffix-free regular languages
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
State complexity of catenation combined with union and intersection
CIAA'10 Proceedings of the 15th 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
State complexity of four combined operations composed of union, intersection, star and reversal
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
State complexity of union and intersection of star on k regular languages
Theoretical Computer Science
State complexity of the concatenation of regular tree languages
Theoretical Computer Science
State complexity of combined operations with two basic operations
Theoretical Computer Science
Transformations Between Different Models of Unranked Bottom-Up Tree Automata
Fundamenta Informaticae
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 union and intersection of square and reversal on k regular languages
Theoretical Computer Science
Lower bounds for the size of deterministic unranked tree automata
Theoretical Computer Science
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
Mirror Images and Schemes for the Maximal Complexity of Nondeterminism
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
State complexity of star of union and square of union on k regular languages
Theoretical Computer Science
Hi-index | 5.23 |
It appears that the state complexity of each combined operation has its own special features. Thus, it is important and practical to obtain good estimates for some commonly used general cases. In this paper, we consider the state complexity of combined Boolean operations and give an exact bound for all of them in the case when the alphabet is not fixed. Moreover, we show that for any fixed alphabet, this bound can be reached in infinitely many cases. We also consider the state complexity of multiple catenations. The state complexities are obtained in the cases of the catenations of three and four languages. An estimate for the catenation of an arbitrary number of languages is given, which is very close to the state complexities in the three and four languages cases.