Professional Documents
Culture Documents
Base step: Give a NFA that accepts each of the simple Inductive step: For each of the operations -- union,
or “base” languages, ∅, {λ}, and {a} for each a ∈ Σ. concatenation and Kleene star -- show how to
construct an accepting NFA.
λ
a M2 λ
1
Closure under concatenation: Exercise
M1 M2
Use the construction of the first half of Kleene’s
λ theorem to construct a NFA that accepts the language
L(ab*aa + bba*ab).
λ M1 λ
2
The key step is removing states and re-labeling
transitions with regular expressions. Here are Exercise
some examples of how to do this.
b
a a,b a (a+b)
a a ab*a
b λ b λ
b ab*a
a
b ab*b
Continue ...
a
b
b ab*b
a
a ab*a
Exercise Exercise
Find a regular expression that corresponds to the
Find a regular expression that corresponds to the language accepted by the following DFA.
language accepted by the following DFA. 0
q0 q1
a b
a 0
1 1
q2
b 1
0