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

Name: Lecture 2: Nondeterminism, Closure Properties, Regular Expressions → Finite Automata
Uploaded: 2021-10-06T12:44:33Z
Duration: 1 h 3 min 27 s
Description: 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

1:03:27

Up Next

Lecture 3: Regular Pumping Lemma, Finite Automata → Regular Expressions, CFGs

Continue

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