Reversals-space-parallelism tradeoffs for language recognition
Juraj Hromkovič (1991)
Mathematica Slovaca
Similarity:
Juraj Hromkovič (1991)
Mathematica Slovaca
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....
Viliam Geffert, Norbert Popély (2000)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Maria José Serna (1989)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Miloslav Nekvinda (1973)
Kybernetika
Similarity: