×
Galil, Zvi

Two fast simulations which imply some fast string matching and palindrome-recognition algorithms. (English) Zbl 0328.68047

Inf. Process. Lett. 4, 85-87 (1976).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0328.68047

Cited in 8 Documents

MSC:

68Q25 Analysis of algorithms and problem complexity
68W99 Algorithms in computer science
68Q45 Formal languages and automata
03D10 Turing machines and related notions
Cite Review PDF
Full Text: DOI

References:

[1] Aho, A. V.; Hopcroft, J. E.; Ullman, J. D., The Design and Analysis of Computer Algorithms (1974), Addison-Wesley: Addison-Wesley Reading, Mass. · Zbl 0286.68029
[2] Azlazarov, V. L.; Divic, E. A.; Kronrod, M. A.; Fardez, I. A., On economical construction of transitive closure of a directed graph, Soviet Math. Dokl., 11, 5, 1209-1210 (1970), English translation in · Zbl 0214.23601
[3] Cook, S. A., Linear time simulation of deterministic two-way pushdown automata, (Proc. IFIP Congress, 17 (1971), North-Holland: North-Holland Amsterdam), 172-179, TA-2
[4] Fischer, M. J.; Paterson, M. S., String matching and other products, Siam AMS Proc. on Complexity of Computation, 113-126 (1974) · Zbl 0301.68027
[5] Fischer, M. J.; Stockmeyer, L. J., Fast on-line integer-multiplication, 5th ACM Symp. on Theory of Computing, 67-72 (1973) · Zbl 0306.68029
[6] Hopcroft, J. E.; Paul, W. J.; Valiant, L. G., On time versus space and related problems, 16th Ann. Symp. on Mathematical Foundations of Computer Science (1975)
[7] Manacher, G., A new linear-time on-line algorithm for finding the smallest initial palindrome of a string, JACM, 22, 346-351 (1975) · Zbl 0305.68027
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.