|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
17th Annual Symposium on Foundations of Computer Science (FOCS 1976)
Recognizing certain repetitions and reversals within strings
October 25-October 27
| ASCII Text | x | ||
| Zvi Galil, Joel Seiferas, "Recognizing certain repetitions and reversals within strings," Foundations of Computer Science, IEEE Annual Symposium on, pp. 236-252, 17th Annual Symposium on Foundations of Computer Science (FOCS 1976), 1976. | |||
| BibTex | x | ||
| @article{ 10.1109/SFCS.1976.25, author = {Zvi Galil and Joel Seiferas}, title = {Recognizing certain repetitions and reversals within strings}, journal ={Foundations of Computer Science, IEEE Annual Symposium on}, volume = {0}, year = {1976}, issn = {0272-5428}, pages = {236-252}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1976.25}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Foundations of Computer Science, IEEE Annual Symposium on TI - Recognizing certain repetitions and reversals within strings SN - 0272-5428 SP236 EP252 A1 - Zvi Galil, A1 - Joel Seiferas, PY - 1976 VL - 0 JA - Foundations of Computer Science, IEEE Annual Symposium on ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SFCS.1976.25
Let P1 = {w ε Σ*:w = wR, |w| > 1} be the set of all nontrivial palindromes over Σ. In Part I, we present a linear-time on-line recognition algorithm for P1* ("palstar") on a random-access machine with addition and uniform cost criterion. We also present a lineartime on-line recognition algorithm for P12 on a multitape Turing machine and a recognition algorithm for P12 on a two-way deterministic pushdown automaton. The correctness of these algorithms is based on new "cancellation lemmas" for the languages P1* and P12. In Part II, we present real-time recognition algorithms for the languages {wxyxz ε Σ*: |w|=r|x|, |y|=s|x|, |z|=t|x|} and {wxyxRz ε Σ*: |w|=r|x|, |y|=s|x|, |z|=t|x|} on multitape Turing machines, for arbitrary fixed r, s, and t.
Citation:
Zvi Galil, Joel Seiferas, "Recognizing certain repetitions and reversals within strings," focs, pp.236-252, 17th Annual Symposium on Foundations of Computer Science (FOCS 1976), 1976
Usage of this product signifies your acceptance of the Terms of Use.
