Palindrome recognition using a multidimensional tape.

DOI10.1016/S0304-3975(03)00086-0zbMath1044.68052WikidataQ57690049 ScholiaQ57690049MaRDI QIDQ1401342

Martin L. Demaine, Tomáš Vinař, Erik D. Demaine, Therese C. Biedl, Mohammad Taghi Hajiaghayi, Jonathan F. Buss

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Turing machinesMultidimensional tapesPalindrome

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

What Is an Algorithm? ⋮ Searching for Gapped Palindromes ⋮ ASMs and Operational Algorithmic Completeness of Lambda Calculus ⋮ Axiomatization and characterization of BSP algorithms ⋮ Searching for gapped palindromes

Cites Work

• Palindrome recognition in real time by a multitape Turing machine
• One-tape, off-line Turing machine computations