Some applications of a technique of Sakoda and Sipser
ACM SIGACT News
Communication complexity method for measuring nondeterminism in finite automata
Information and Computation
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
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
General Algorithms for Testing the Ambiguity of Finite Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
State complexity of unique rational operations
Theoretical Computer Science
Two-way unary automata versus logarithmic space
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
Two-way unary automata versus logarithmic space
Information and Computation
Descriptional complexity of unambiguous nested word automata
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Ambiguity of unary symmetric difference NFAs
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
On separating constant from polynomial ambiguity of finite automata
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Structurally unambiguous finite automata
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Unambiguous finite automata over a unary alphabet
Information and Computation
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
State complexity and limited nondeterminism
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
| Hi-index | 0.00 |