Introduction to the Course

Finite State Automata: Preliminaries

Finite State Automata: Intuition

Transition graph

How FSAs Work

Formal Definition of FSA

How Knowledge on FSAs is Gauged

Formal Definition of Computation

Designing Finite Automata

Regular Expressions: Preliminaries

Computing Star Operation

Computing Languages

Working with REs

Interesting Cases

Equivalence or REs and FSAs

Non-regular Languages

Summary