Magic numbers in the state hierarchy of finite automata
Information and Computation
Nondeterministic one-tape off-line turing machines and their time complexity
Journal of Automata, Languages and Combinatorics
One Pebble Versus ε · log n Bits
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Magic numbers in the state hierarchy of finite automata
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Hi-index | 0.89 |