A leaf-size hierarchy of alternating rebound Turing machines
Journal of Automata, Languages and Combinatorics
Factoring and Testing Primes in Small Space
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
One Pebble Versus ε · log n Bits
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
An alternating hierarchy for finite automata
Theoretical Computer Science
Unary coded NP-complete languages in ASPACE (log log n)
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
| Hi-index | 0.00 |