✦ LIBER ✦

Palindrome recognition using a multidimensional tape

✍ Scribed by Therese Biedl; Jonathan F. Buss; Erik D. Demaine; Martin L. Demaine; Mohammadtaghi Hajiaghayi; Tomáš Vinař

No coin nor oath required. For personal study only.

✦ Synopsis

The problem of palindrome recognition using a Turing machine with one multidimensional tape is proved to require (n 2 =log n) time.

📜 SIMILAR VOLUMES

Multidimensional Red Tape: A Theory Coda

✍ Bozeman, Barry 📂 Article 📅 2012 🏛 Taylor and Francis Group 🌐 English ⚖ 234 KB

Line-based recognition using a multidime

✍ Xilin Yi; Camps, O.I. 📂 Article 📅 1999 🏛 IEEE 🌐 English ⚖ 959 KB

Recognition without Correspondence using

✍ Bernt Schiele; James L. Crowley 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 682 KB

Experiments in continuous speech recogni

✍ P. Kenny; G. Boulianne; H. Garudadri; S. Trudelle; R. Hollan; M. Lennig; D. O'Sh 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 1001 KB

A multidimensional approach to syntactic

✍ Kenneth L. Williams 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 998 KB

Multidimensional letter similarity deriv

✍ Gilmore, G. C. ;Hersh, H. ;Caramazza, A. ;Griffin, J. 📂 Article 📅 1979 🏛 Psychonomic Society Publications 🌐 English ⚖ 720 KB