Lecture 1: Introduction, Finite Automata, Regular Expressions

Name: Lecture 1: Introduction, Finite Automata, Regular Expressions
Uploaded: 2021-10-06T12:48:25Z
Duration: 1 h 34 s
Description: Description: Introduction; course outline, mechanics, and expectations. Described finite automata, their formal definition, regular languages, regular operations, and regular expressions. Proved that the class of regular languages is closed under ⋃. Started proving closure under ◦. Instructor: Prof. Michael Sipser

1:00:34

Up Next

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

Continue

Description: Introduction; course outline, mechanics, and expectations. Described finite automata, their formal definition, regular languages, regular operations, and regular expressions. Proved that the class of regular languages is closed under ⋃. Started proving closure under ◦.

Instructor: Prof. Michael Sipser