Formal Languages and Computability (INF3, Autumn'05)
Lecture 3
Main topic:
Regular expressions
Lecture Plan
- closure properties using nondeterministic finite automata
- regular expressions (syntax and semantics)
- relationship of regular expressions and regular languages
Reading
- Section 1.2 (p. 58-63)
- Section 1.3 (p. 63-76)