On the Power of Las Vegas II. Two-Way Finite Automata
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Converting two-way nondeterministic unary automata into simpler automata
Theoretical Computer Science - Mathematical foundations of computer science
Descriptional complexity of finite automata: concepts and open problems
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
On the Size Complexity of Rotating and Sweeping Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Deterministic moles cannot solve liveness
Journal of Automata, Languages and Combinatorics
A technique for proving lower bounds on the size of sweeping automata
Journal of Automata, Languages and Combinatorics
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Describing periodicity in two-way deterministic finite automata using transformation semigroups
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Size complexity of rotating and sweeping automata
Journal of Computer and System Sciences
Small sweeping 2NFAs are not closed under complement
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Two-Way automata making choices only at the endmarkers
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Hi-index | 0.00 |