Lecture 2: Nondeterminism, Closure Properties, Regular Expressions → Finite Automata

Om kurset

Description: Quickly reviewed last lecture. Introduced nondeterministic finite automata (NFA). Proved that NFA and DFA are equivalent in power. Proved that the class of regular languages is closed under ◦, ∗. Showed conversion of regular expressions to NFAs. Instructor: Prof. Michael Sipser