On real-time recognition of the relation of occurrence
Zapiski Nauchnykh Seminarov POMI, Studies in constructive mathematics and mathematical logic. Part IV, Tome 20 (1971), pp. 104-114
Voir la notice de l'article provenant de la source Math-Net.Ru
It is shown that the relation "word $Q$ occurs in word $P$" is real-time recognizable by a Turing machine with two-dimensional tape.
@article{ZNSL_1971_20_a10,
author = {Yu. V. Matiyasevich},
title = {On real-time recognition of the relation of occurrence},
journal = {Zapiski Nauchnykh Seminarov POMI},
pages = {104--114},
publisher = {mathdoc},
volume = {20},
year = {1971},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZNSL_1971_20_a10/}
}
Yu. V. Matiyasevich. On real-time recognition of the relation of occurrence. Zapiski Nauchnykh Seminarov POMI, Studies in constructive mathematics and mathematical logic. Part IV, Tome 20 (1971), pp. 104-114. http://geodesic.mathdoc.fr/item/ZNSL_1971_20_a10/