Real-time algorithms for string-matching and palindrome recognition

Authors:
Zvi Galil
Affiliations:
-
Venue:
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Year:
1976

Citing 3
Cited 4

Real-Time Simulation of Multihead Tape Units

Journal of the ACM (JACM)
A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String

Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

String Matching in Real Time

Journal of the ACM (JACM)
On the Complexity of Determining the Period of a String

COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Data hiding methods based upon DNA sequences

Information Sciences: an International Journal
On palindromic sequence automata and applications

CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a sufficient condition when an on-line algorithm can be transformed into a real-time algorithm. We use this condition to construct real-time algorithms for string-matching and palindrome recognition problems by random access machines and by Turing machines.