THEORY OF COMPUTATION

NON-DETERMINISTIC FINITE AUTOMATA

1. Design a NFA for the language of all strings over {a, b, c} that ends with ab,
bc or ca.

2. An NFA for all the language of all strings over {0, 1} that ends with 0110,010,
or 00.

3.

An NFA that accepts the language (ab (aab)*a*)*

4. An NFA that accepts the language a(a + b)*b.

ShrutiChandra

THEORY OF COMPUTATION

5. An NFA that accepts the language (a ab)*.

6. An NFA that accepts the language (aa)* b*.

7. An NFA with no more than five states for the set {abab n: n0} {aban : n
0}.

ShrutiChandra

THEORY OF COMPUTATION

8. Find an NFA with four states for L = {an : n 0} {bna : n 1}.

9. Construct an NFA with three states that accepts the language {ab, abc}*.

10.Construct an NFA for (ab)*(ba)* aa*.

ShrutiChandra

THEORY OF COMPUTATION

ShrutiChandra