On converting on-line algorithms into real-time and on real-time algorithms for string-matching and palindrome recognition

Authors:
Zvi Galil
Affiliations:
IBM Thomas J. Watson Research Center, Yorktown Heights, New York 10598
Venue:
ACM SIGACT News
Year:
1975

Citing 2
Cited 1

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

Real-time indexing over fixed finite alphabets

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms

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.