References
References
- Aho A Hopocroft J Ullman J (1974) The Design and Analysis of Computer Algorithms, Addison-Wesley Reading Mass
- Aho A Ullman J (1972) The Theory of Parsing, Translation, and Compiling, Prentice-Hall Englewood Cliffs NJ
- Aho A (1980) In: R. Book (Ed.) Pattern Matching in Strings. Formal Language Theory, Academic Press
- McNaughton R Yamada H (1960) Regular expressions and state graphs for automata Trans. IRS EC-9 39 47
- Glushkov , VM . (1961) . The abstract theory of automata . Russian Mathematical Surveys , 16 : 1 – 53 .
- Thompson , K . (1968) . Regular expression search algorithm . Communications of the ACM , 11 ( 6 ) : 410 – 422 .
- Chang CH (1992) Regular expressions to DFA's using compressed NFA's Ph.D Thesis, Department of Computer Science, Courant Institute New York
- Antimirov V (1996) Partial derivatives of regular expressions and finite automata construction Theoretical Computer Science, 155 291 319
- Wu S Manber U (1992) Agrep: a fast approximate pattern matching tool Proceedings of USENIX Winter 1992 Technical Conference San Francisco CA 153 162
- Berry , G and Sethi , R . (1986) . From regular expressions to deterministic automata . Theoretical Computer Science , 48 : 117 – 126 .
- Meyer , E . (1992) . A four-Russians algorithm for regular expression pattern matching . Journal of ACM , 39 ( 2 ) : 432 – 448 .
- Clark , C and Cormack , G . (1997) . On the use of regular expressions for searching text . ACM Trans. on Programming Languages and Systems , 19 ( 3 ) : 413 – 426 .