Lecture 1: Introduction, Finite Automata, Regular Expressions

Om kurset

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