Two-way multihead automata over a one-letter alphabet
Burkhard Monien (1980)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Burkhard Monien (1980)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Andrzej Szepietowski (1999)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
W. Bucher, K. Culik II (1984)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Jean-Camille Birget (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Karel Culik II, Juhani Karhumäki (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Viliam Geffert, L'ubomíra Ištoňová (2010)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
We study the relation between the standard two-way automata and more powerful devices, namely, two-way finite automata equipped with some additional “pebbles” that are movable along the input tape, but their use is restricted (nested) in a stack-like fashion. Similarly as in the case of the classical two-way machines, it is not known whether there exists a polynomial trade-off, in the number of states, between the nondeterministic and deterministic two-way automata with nested pebbles....
S. A. Greibach (1977)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: