Formal Languages and Computability (INF3, Autumn'05)
Lecture 2
Main topic:
Nondeterministic finite automata
Lecture Plan
- regular languages and closure properties
- nondeterministic finite automata
- relationship of nondeterministic and deterministic finite automata
Reading
- Section 1.1 (p. 44-47)
- Section 1.2 (p. 47-58)