On optimum time bounds for recognition of some sets of words by on-line Turing machines
Pavel Strnad (1969)
Kybernetika
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Recursive functions computable within ”
On optimum time bounds for recognition of some sets of words by on-line Turing machines
Some modifications of auxiliary pushdown automata
G. Buntrock, F. Drewes, C. Lautemann, T. Mossakowski (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Efficient string matching on packed texts
D. Breslauer, Leszek Gasieniec (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A Turing machine space hierarchy
Stanislav Žák (1979)
Kybernetika
Similarity: