Abstract
Real-time multitape Turing machine algorithms are presented for recognizing the languages {wxyxz∈Σ*:|w|=r|x,|z| =t|x|} and {wxyx R z ∈Σ*:|w|=r|x,|z| =t|x|} for fixedr, s, andt and for string-matching with “forced mismatches.”
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. J. Atrubin, A one-dimensional real-time iterative multiplier,IEEE Transactions on Electronic Computers EC-14 (1965), 394–399.
S. N. Cole, Real-time computation by iterative arrays of finite-state machines. Doctoral Thesis, Harvard University, Cambridge, Massachusetts, August 1964.
S. N. Cole, Real-time computation byn-dimensional iterative arrays of finite-state machines,IEEE Transactions on Computers C-13 (1969), 349–365.
S. A. Cook andS. O. Aanderaa, On the minimum computation time of functions,Transactions of the American Mathematical Society 142 (1969), 291–314.
N. J. Fine andH. S. Wilf, Uniqueness theorems for periodic functions,Proceedings of the American Mathematical Society 16 (1965), 109–114.
N. J. Fine and M. S. Paterson, String-matching and other products, inComplexity of Computation (SIAM-AMS Proceedings 7), R. M. Karp, ed., American Mathematical Society, Providence, Rhode Island (1974), 113–125.
P. C. Fischer, A. R. Meyer, andA. L. Rosenberg, Real-time simulation of multihead tape units,Journal of the Association for Computing Machinery 19 (1972), 590–607.
Z. Galil, String-matching in real time, submitted for publication.
Z. Galil, Palindrome recognition in real time by a multitape Turing machine,Journal of Computer and System Sciences, to appear.
D. E. Knuth, J. H. Morris, Jr., andV. R. Partt, Fast pattern matching in strings,SIAM Journal on Computing 6 (1977), 323–350.
R. C. Lyndon andM. P. Schützenberger, The equationa M=N c P in a free group,Michigan Mathematical Journal 9 (1962), 289–298.
G. Manacher, A new linear-time “on-line” algorithm for finding the smallest initial palindrome of a string,Journal of the Association for Computing Machinery 22 (1975), 346–351.
J. I. Seiferas, Iterative arrays with direct central control,Acta Informatica 8 (1977), 177–192.
A. O. Slisenko, Recognition of palindromes by multihead Turing machines (in Russian), inProblems in the Constructive Trend in Mathematics. VI (Proceedings of the Steklov Institute of Mathematics, No. 129), V. P. Orevkov and N. A. Sanin, ed., Academy of Sciences of the USSR (1973), 30–202; English translation by R. H. Silverman, American Mathematical Society, Providence, Rhode Island (1976), 25–208.
A. O. Slisenko, private communication, July 1976.
A. O. Slisenko, A simplified proof of real-time recognizability of palindromes on Turing machines (in Russian), inTheoretical Applications of Methods of Mathematical Logic. II (Proceedings of the Scientific Seminars of the Leningrad Branch of the Steklov Institute of Mathematics,68, G. E. Mintz and V. P. Orevkov, ed., Academy of Sciences of the USSR (1977), 123–139.
Author information
Authors and Affiliations
Additional information
This research was supported in part by the National Science Foundation under Grant MCS77-06613 (first author) and the Bat-Sheva Fund (second author). Part of the work was conducted while the second author was at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York. A preliminary report was included in a paper the authors presented at the Seventeenth Annual IEEE Symposium on Foundations of Computer Science, Houston, Texas, October 1976.
Rights and permissions
About this article
Cite this article
Seiferas, J., Galil, Z. Real-time recognition of substring repetition and reversal. Math. Systems Theory 11, 111–146 (1977). https://doi.org/10.1007/BF01768472
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01768472