State Complexity: Recent Results and Open Problems

Authors:
Sheng Yu
Affiliations:
(Correspd.) Department of Computer Science, University of Western Ontario, London, Ontario, Canada N6A 5B7. syu@csd.uwo.ca
Venue:
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Year:
2005

Citing 21
Cited 3

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
Regular languages

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

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
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
On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata

IEEE Transactions on Computers
Economy of description by automata, grammars, and formal systems

SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Finite automata and their decision problems

IBM Journal of Research and Development
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

Sheng Yu (1950-2012) In Memoriam

Fundamenta Informaticae
Descriptional complexity of determinization and complementation for finite automata

CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
Descriptional complexity of determinization and complementation for finite automata

CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.