Journal ArticleOPEN ACCESS

String Matching in Real Time

Journal of the ACM (JACM) (1981) 28(1) 134-149
DOI: 10.1145/322234.322244
38Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

A sufficient condition for an on-line algorithm to be transformed into a real-time algorithm is given. This condition is used to construct real-time algorithms for various string-matching problems by random access machines and by Turing machines. © 1981, ACM. All rights reserved.

Cite

CITATION STYLE

APA

Galil, Z. (1981). String Matching in Real Time. Journal of the ACM (JACM), 28(1), 134–149. https://doi.org/10.1145/322234.322244

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free