A note on the space complexity of some decision problems for finite automata
Information Processing Letters
Reducing nondeterministic finite automata with SAT solvers
FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Büchi automata can have smaller quotients
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Advanced automata minimization
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Hi-index | 0.00 |