Access Restriction

Author Myers, Gene
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1992
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Four Russians paradigm ♦ Finite automaton ♦ Node listing ♦ Regular expression
Abstract Given a regular expression $\textit{R}$ of length $\textit{P}$ and a word $\textit{A}$ of length $\textit{N},$ the membership problem is to determine if $\textit{A}$ is in the language denoted by $\textit{R}.$ An $\textit{O}(\textit{PN}/lg\textit{N})$ time algorithm is presented that is based on a $lg\textit{N}$ speedup of the standard $\textit{O}(\textit{PN})$ time simulation of $\textit{R}'s$ nonderministic finite automaton on $\textit{A}$ using a combination of the node-listing and “Four-Russians” paradigms. This result places a new worst-case upper bound on regular expression pattern matching. Moreover, in practice the method provides an implementation that is faster than existing software for small regular expressions.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1992-04-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 39
Issue Number 2
Page Count 17
Starting Page 432
Ending Page 448

Open content in new tab

   Open content in new tab
Source: ACM Digital Library