Partial orders on words, minimal elements of regular languages, and state complexity
Theoretical Computer Science
SIAM Journal on Computing
A lower bound technique for the size of nondeterministic finite automata
Information Processing Letters
Communication complexity and parallel computing
Communication complexity and parallel computing
State complexity of regular languages
Journal of Automata, Languages and Combinatorics
Descriptional complexity of finite automata: concepts and open problems
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Minimizing finite automata is computationally hard
Theoretical Computer Science - Developments in language theory
State complexity of combined operations
Theoretical Computer Science
Inapproximability of nondeterministic state and transition complexity assuming P ≠ NP
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Regular expressions and NFAs without Ε-transitions
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Lower bounds for the transition complexity of NFAs
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Minimizing NFA's and regular expressions
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Finding lower bounds for nondeterministic state complexity is hard
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Nonterminal Complexity of Some Operations on Context-Free Languages
Fundamenta Informaticae
The Tractability Frontier for NFA Minimization
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
On the Hardness of Determining Small NFA's and of Proving Lower Bounds on Their Sizes
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Nondeterministic state complexity of nested word automata
Theoretical Computer Science
Theoretical Computer Science
The tractability frontier for NFA minimization
Journal of Computer and System Sciences
Nonterminal Complexity of Some Operations on Context-Free Languages
Fundamenta Informaticae
| Hi-index | 0.00 |
In this talk, I will survey recent results and discuss open problems on the state and transition complexity of nondeterministic finite automata.