Chapter 1: Regular Languages

For Your Enjoyment

Chapter 1.1, Finite Automata

Machine M = (Q, Σ, δ, q0, F) accepts string w = w1...wn where each wi ∈ Σ if a sequence of states r0...rn exists with


A language is a regular language if some finite automaton recognizes it.

Active Learning Problems


Let A and B be languages. The regular operations are

Lecture Problem

Construct a finite automaton that recognizes the union of binary strings that contain either an even number of symbols or a number of symbols that is evenly divisible by 3.

Active Learning Problem

In-Class Notes

Valid XHTML 1.0!