|
Zapiski Nauchnykh Seminarov LOMI, 1977, Volume 68, Pages 123–139
(Mi znsl2005)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
A simplified proof of the real-time recognizability of palindromes on turing machines
A. O. Slisenko
Abstract:
A comparatively short proof is given of the recognizability of palindromes in real time on multitape Turing machines. It is based on the same idea as the original proof by the author, and on Z. Galil's idea for simplifying the proof by using the Fischer–Paterson algorithm for finding all symmetric suffixes in linear time.
Citation:
A. O. Slisenko, “A simplified proof of the real-time recognizability of palindromes on turing machines”, Theoretical application of methods of mathematical logic. Part II, Zap. Nauchn. Sem. LOMI, 68, "Nauka", Leningrad. Otdel., Leningrad, 1977, 123–139; J. Soviet Math., 15:1 (1981), 68–77
Linking options:
https://www.mathnet.ru/eng/znsl2005 https://www.mathnet.ru/eng/znsl/v68/p123
|
Statistics & downloads: |
Abstract page: | 212 | Full-text PDF : | 79 |
|