Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Zvi Galil (1975) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: