On the state complexity of intersection of regular languages
ACM SIGACT News
Intersection and union of regular languages and state complexity
Information Processing Letters
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)
Theory of Automata
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
Compressed Storage of Sparse Finite-State Transducers
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
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
State complexity of basic language operations combined with reversal
Information and Computation
Hopcroft's Minimization Technique: Queues or Stacks?
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
State Complexity of Nested Word Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Analysing Complexity in Classes of Unary Automatic Structures
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
On the Hopcroft's minimization technique for DFA and DFCA
Theoretical Computer Science
State complexity of unique rational operations
Theoretical Computer Science
Nondeterministic state complexity of nested word automata
Theoretical Computer Science
Operational state complexity of nested word automata
Theoretical Computer Science
Concatenation of Regular Languages and Descriptional Complexity
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
On transition minimality of bideterministic automata
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Assisted problem solving and decompositions of finite automata
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Lower bounds for complementation of ω-automata via the full automata technique
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
On the state complexity of combined operations
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
State complexity of projection and quotient on unranked trees
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Hi-index | 0.00 |
In this paper, we summarize recent results and progress in state complexity research. We analyze why many basic state complexity problems were not solved earlier, in the sixties and seventies. We also suggest several future directions for this area of research.