On the Power of Las Vegas II. Two-Way Finite Automata

Author(s):  
Juraj Hromkovič ◽  
Georg Schnitger
Keyword(s):  
2004 ◽  
Vol 15 (05) ◽  
pp. 791-807
Author(s):  
KATSUSHI INOUE ◽  
AKIRA ITO ◽  
TAKASHI KAMIURA ◽  
HOLGER PETERSEN ◽  
LAN ZHANG

This paper continues the investigation of rebound Turing machines (RTM's). We first investigate a relationship between the accepting powers of simple one-way 2-head finite automata and simultaneously space-bounded and leaf-size bounded alternating RTM's, and show that for any functions L(n) and Z(n) such that L(n)Z(n)=o( log n) and [Formula: see text], simple one-way 2-head finite automata are incomparable with simultaneously L(n) space-bounded and Z(n) leaf-size bounded alternating RTM's. We then investigate a relationship between Las Vegas and determinism for space-bounded RTM's, and show that there is a language accepted by a Las Vegas rebound automaton, but not accepted by any weakly o( log log n) space-bounded deterministic RTM. This is the first separation result between Las Vegas and determinism for space-bounded computing models over strings.


2004 ◽  
Vol 68 (3) ◽  
pp. 675-699 ◽  
Author(s):  
Pavol Ďuriš ◽  
Juraj Hromkovič ◽  
Katsushi Inoue

2001 ◽  
Vol 262 (1-2) ◽  
pp. 1-24 ◽  
Author(s):  
Juraj Hromkovič ◽  
Georg Schnitger
Keyword(s):  

10.1029/ft385 ◽  
1989 ◽  
Author(s):  
Christopher C. Barton ◽  
Paul A. Hsieh ◽  
Jacques Angelier ◽  
Francoise Bergerat ◽  
Catherine Bouroz ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document