Communication complexity hierarchy
Theoretical Computer Science
Parsing theory. Vol. 1: languages and parsing
Parsing theory. Vol. 1: languages and parsing
Relating the type of ambiguity of finite automata to the succinctness of their representation
SIAM Journal on Computing
On measuring nondeterminism in regular languages
Information and Computation
On the relation between ambiguity and nondeterminism in finite automata
Information and Computation
SIAM Journal on Computing
Regular expressions into finite automata
Theoretical Computer Science
A lower bound technique for the size of nondeterministic finite automata
Information Processing Letters
Communication complexity and parallel computing
Communication complexity and parallel computing
Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata
SIAM Journal on Computing
Programming Techniques: Regular expression search algorithm
Communications of the ACM
On the power of Las Vegas II: two-way finite automata
Theoretical Computer Science
On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
Information and Computation
Translating regular expressions into small εe-free nondeterministic finite automata
Journal of Computer and System Sciences
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Proceedings of the 7th Colloquium on Automata, Languages and Programming
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
A lower bound on the size of ɛ-free NFA corresponding to a regular expression
Information Processing Letters
Nondeterminism and the size of two way finite automata
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
An n log n algorithm for minimizing states in a finite automaton
An n log n algorithm for minimizing states in a finite automaton
Succinctness of descriptions of context-free, regular and finite languages.
Succinctness of descriptions of context-free, regular and finite languages.
State complexity of some operations on binary regular languages
Theoretical Computer Science - Descriptional complexity of formal systems
Transition complexity of language operations
Theoretical Computer Science
Nondeterministic Finite Automata--Recent Results on the Descriptional and Computational Complexity
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
On the State Complexity of Complements, Stars, and Reversals of Regular Languages
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Lower bounds for the transition complexity of NFAs
Journal of Computer and System Sciences
State Complexity of Nested Word Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
On the descriptional complexity of Watson-Crick automata
Theoretical Computer Science
Operational state complexity of nested word automata
Theoretical Computer Science
Descriptional complexity of nondeterministic finite automata
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Deterministic blow-ups of minimal nondeterministic finite automata over a fixed alphabet
DLT'07 Proceedings of the 11th international conference on Developments in language theory
On transition minimality of bideterministic automata
DLT'07 Proceedings of the 11th international conference on Developments in language theory
The complexity of regular(-like) expressions
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Nondeterminism is essential in small 2FAs with few reversals
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Lower bounds for the transition complexity of NFAs
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
State complexity of concatenation and complementation of regular languages
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Finding lower bounds for nondeterministic state complexity is hard
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Reversal hierarchies for small 2DFAs
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Nondeterminism is essential in small two-way finite automata with few reversals
Information and Computation
| Hi-index | 0.02 |
"Automata theory is not over" is the message of this paper. But if one wishes a renaissance of automata theory, then one should prefer to return to the investigation of the fundamental, classical problems of automata theory rather then searching for new applications and defining numerous questionable modifications of basic models. We argue for this opinion here and try co outline a way that could lead to a renaissance of automata theory.