Descriptional and Computational Complexity of Finite Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
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
From equivalence to almost-equivalence, and beyond--minimizing automata with errors
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
| Hi-index | 0.00 |