Partial orders on words, minimal elements of regular languages, and state complexity
Theoretical Computer Science
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
Tight bounds on the number of states of DFAs that are equivalent to n-state NFAs
Theoretical Computer Science
On the state complexity of k-entry deterministic finite automata
Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Theory of Automata
Tight lower bound for the state complexity of shuffle of regular languages
Journal of Automata, Languages and Combinatorics
Average State Complexity of Operations on Unary Automata
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
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: Recent Results and Open Problems
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
State complexity of combined operations
Theoretical Computer Science
Regular expressions: new results and open problems
Journal of Automata, Languages and Combinatorics
The state complexity of L2 and Lk
Information Processing Letters
Unary language operations and their nondeterministic state complexity
DLT'02 Proceedings of the 6th international conference on Developments in language theory
State complexity of basic operations on nondeterministic finite automata
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Hopcroft's Minimization Technique: Queues or Stacks?
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
Fundamenta Informaticae
On the Hopcroft's minimization technique for DFA and DFCA
Theoretical Computer Science
Estimation of state complexity of combined operations
Theoretical Computer Science
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 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 combined operations with two basic operations
Theoretical Computer Science
Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
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 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
State complexity of star of union and square of union on k regular languages
Theoretical Computer Science
| Hi-index | 0.00 |
The state complexity of combined operations is studied. We show that the state complexity of a combined operation can be very different from the composition of the state complexities of the participating individual operations. However, the estimate through individual nondeterministic state complexities for each of the combined operations being considered is very similar to the actual state complexity. Several open problems related to state complexity are also proposed.