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

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.