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

Name: Lecture 3: Regular Pumping Lemma, Finite Automata → Regular Expressions, CFGs
Uploaded: 2021-10-06T12:46:14Z
Duration: 1 h 10 min 2 s
Description: Description: Quickly reviewed last lecture. Showed conversion of DFAs to regular expressions. Gave a method for proving languages not regular by using the pumping lemma and closure properties. Introduced context free grammars (CFGs). Instructor: Prof. Michael Sipser

1:10:02

Up Next

Lecture 4: Pushdown Automata, CFG ↔ PDA

Continue

Description: Quickly reviewed last lecture. Showed conversion of DFAs to regular expressions. Gave a method for proving languages not regular by using the pumping lemma and closure properties. Introduced context free grammars (CFGs).

Instructor: Prof. Michael Sipser