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

DOI10.1007/BF01404109zbMath0449.03029MaRDI QIDQ1147125

A. O. Slisenko

Publication date: 1981

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

zbMATH Keywords

Turing machinespalindromesreal time recognition

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Turing machines and related notions (03D10)

Related Items (1)

Turing Machines for Dummies

Cites Work

• Unnamed Item
• Real-time recognition of substring repetition and reversal
• Real-Time Simulation of Multihead Tape Units

This page was built for publication: A simplified proof of the real-time recognizability of palindromes on Turing machines