Back to Results
First PageMeta Content
Models of computation / Mathematics / Symbol / Nondeterministic finite automaton / Formal languages / Cycle rank / Ε-quadratic form / Graph theory / Theoretical computer science / Automata theory


APPROXIMATE MATCHING OF REGULAR EXPRESSIONS EUGENE W. MYERS† Department of Computer Science University of Arizona Tucson, AZ 85721
Add to Reading List

Document Date: 2006-03-21 10:39:03

Open Document

File Size: 126,48 KB

Share Result on Facebook
UPDATE