Abstract
R. Kannan conjectured that every non-deterministic two-way finite automaton can be positionally simulated by a deterministic two-way finite automaton. The conjecture is proved here by reduction to a similar problem about finite monoids. The method and the result are then generalized to alternating two-way finite automata, certain alternating one-tape linear-time Turing machines, and one-pebble automata.
Original language | English (US) |
---|---|
Pages (from-to) | 154-179 |
Number of pages | 26 |
Journal | Journal of Computer and System Sciences |
Volume | 45 |
Issue number | 2 |
DOIs | |
State | Published - Oct 1992 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Networks and Communications
- Computational Theory and Mathematics
- Applied Mathematics