Translation from Classical Two-Way Automata to Pebble Two-Way Automata
We study the relation between the standard two-way automata and more powerful devices, namely, two-way finite automata with an additional "pebble" movable along the input tape. Similarly as in the case of the classical two-way machines, it is not known whether there exists a polynomial tra...
Main Authors: | Viliam Geffert, Ľubomíra Ištoňová |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2009-07-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/0907.5127v1 |
Similar Items
-
Classical Automata on Promise Problems
by: Viliam Geffert, et al.
Published: (2015-09-01) -
Simulation of Two-Way Pushdown Automata Revisited
by: Robert Glück
Published: (2013-09-01) -
On Determinism and Unambiguity of Weighted Two-way Automata
by: Vincent Carnino, et al.
Published: (2014-05-01) -
Succinctness of two-way probabilistic and quantum finite automata
by: Abuzer Yakaryilmaz, et al.
Published: (2010-01-01) -
Two-Way Finite Automata: Old and Recent Results
by: Giovanni Pighizzini
Published: (2012-08-01)