15-453 Formal Languages, Automata, and Computation
Lecture 6: Regular Expressions

We introduce regular expressions, yet another way to define regular languages. Variations are used in editors, lexer specifications, and languages designed for string processing such as Perl. We show that regular expressions specify precisely the regular languages by translating to and from finite automata.


[ Home | Schedule | Assignments | Handouts | Overview ]

fp@cs
Frank Pfenning