1-1hit |
Tokio OKAZAKI Lan ZHANG Katsushi INOUE Akira ITO Yue WANG
This paper investigates a relationship between accepting powers of two-way deterministic one-counter automata and one-pebble off-line deterministic Turing machines operating in space between loglog n and log n, and shows that they are incomparable.