Chapter 1: Regular Languages

For Your Enjoyment

Chapter 1.2, Nondeterminism

Lecture Problem

Active Learning Problem

Construct a three-state NFA that accepts any binary number that consists of any number of 0s or any number of 1s.


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

Active Learning

Theorem: Every NFA has an equivalent DFA.

Proof Sketch (assuming no ε transitions): Let NFA N = (Q, Σ, δ, q0, F). Construct DFA M = (Q', Σ, δ', q0', F').

Exercise: Convert the three-state NFA above to a DFA using the construction given in the proof.

In-Class Notes

Valid XHTML 1.0!