Minimizing finite automata is computationally hard
Theoretical Computer Science - Developments in language theory
State complexity of some operations on binary regular languages
Theoretical Computer Science - Descriptional complexity of formal systems
State Complexity: Recent Results and Open Problems
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Language equations with complementation: Decision problems
Theoretical Computer Science
State complexity of combined operations
Theoretical Computer Science
The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal
Fundamenta Informaticae
The Tractability Frontier for NFA Minimization
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
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
Remarks on multiple entry deterministic finite automata
Journal of Automata, Languages and Combinatorics
Descriptional and Computational Complexity of Finite Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Converting Self-verifying Automata into Deterministic Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Language operations with regular expressions of polynomial size
Theoretical Computer Science
Minimizing finite automata is computationally hard
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Automata with extremal minimality conditions
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Descriptional complexity of (un)ambiguous finite state machines and pushdown automata
RP'10 Proceedings of the 4th international conference on Reachability problems
Descriptional and computational complexity of finite automata---A survey
Information and Computation
Optimal simulation of self-verifying automata by deterministic automata
Information and Computation
State trade-offs in unranked tree automata
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
The tractability frontier for NFA minimization
Journal of Computer and System Sciences
On the state complexity of combined operations
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Structurally unambiguous finite automata
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
State complexity of concatenation and complementation of regular languages
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Quotient complexity of closed languages
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
State complexity of kleene-star operations on trees
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Extremal minimality conditions on automata
Theoretical Computer Science
State complexity and limited nondeterminism
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal
Fundamenta Informaticae
State Complexity: Recent Results and Open Problems
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Quotient Complexity of Closed Languages
Theory of Computing Systems
| Hi-index | 0.00 |