A formal study of practical regular expressions

International Journal of Foundations of Computer Science

Volumn 14, Issue 6, 2003, Pages 1007-1018

  Câmpeanu, Cezar ^a   Salomaa, Kai ^b   Yu, Sheng ^c  

^a UNIVERSITY OF PRINCE EDWARD ISLAND   (Canada)

^b QUEEN S UNIVERSITY   (Canada)

^c UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

extended regex; formal languages; programming languages; regex; Regular expressions

Indexed keywords

EID: 9544247195     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S012905410300214X     Document Type: Conference Paper

References (11)

1. J.-M. Champarnaud, Implicit Structures to Implement NFA's from Regular Expressions. CIAA 2000 Revised Papers, (S. Yu and A. Paun, Eds.) Lect. Notes Comput. Sci. 2088, Springer-Verlag, 2001, pp. 80-93.
2. J.-M. Champarnaud and D. Ziadi, New Finite Automaton Constructions Based on Canonical Derivatives. CIAA 2000 Revised Papers, (S. Yu and A. Paun, Eds.) Lect. Notes Comput. Sci. 2088, Springer-Verlag, 2001, pp. 94-104.
3. N. Chapman, Perl - The Programmer's Companion, Wiley, Chichester, 1997.
4. K. Ellul, J. Shallit and M. Wang, Regular Expressions: New Results and Open Problems. Proceedings of DCFS'02, (London, Ontario, August 2002), pp. 17-34.
5. Jeffrey E.F. Friedl Mastering Regular Expressions, O'Reilly &Associates, Inc., Cambridge, 1997.
6. J.E. Hopcroft and J.D. UUman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, 1979.
7. J. Hromkovic, S. Seibert and T. Wilke, Translating Regular Expressions into Small e-Free Nondeterministic Finite Automata. Journal of Computer and System Sciences 62 (2001) 565-588.
8. L. Hie and S. Yu, Algorithms for computing small NFAs. Mathematical Foundations of Computer Science, LNCS 2420 (2002) 328-340.
9. M.E. Lesk, "Lex-A lexical analyzer generator", Computer Science Technical Report (1975) 39, AT&T Bell Laboratories, Murray Hill, N.J.
10. A. Mateescu, G. Rozenberg and A. Salomaa, Shuffle on trajectories: Syntactic constraints, Theoretical Computer Science 197 (1998) 1-56.
11. S. Yu, "Regular Languages", in Handbook of Formal Languages, G. Rozenberg and A. Salomaa eds. pps. 41-110, Springer, 1998.