IEEE Annals of the History of Computing - Special issue on Central and Eastern Europe
Converting Two-Way Nondeterministic Unary Automata into Simpler Automata
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Space Hierarchy Theorem Revised
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Space hierarchy theorem revised
Theoretical Computer Science - Mathematical foundations of computer science
Converting two-way nondeterministic unary automata into simpler automata
Theoretical Computer Science - Mathematical foundations of computer science
Magic numbers in the state hierarchy of finite automata
Information and Computation
On the State Complexity of Operations on Two-Way Finite Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Four-dimensional multi-inkdot finite automata
WSEAS Transactions on Computers
Factoring and Testing Primes in Small Space
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Journal of Computer Science and Technology
One Pebble Versus ε · log n Bits
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Oblivious two-way finite automata: decidability and complexity
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
An alternating hierarchy for finite automata
Theoretical Computer Science
Hi-index | 0.00 |