Journal of Soviet Mathematics

, Volume 15, Issue 1, pp 68–77

A simplified proof of the real-time recognizability of palindromes on turing machines

  • Authors
  • A. O. Slisenko
Article

DOI: 10.1007/BF01404109

Cite this article as:
Slisenko, A.O. J Math Sci (1981) 15: 68. doi:10.1007/BF01404109

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.

Copyright information

© Plenum Publishing Corporation 1981