46 views

Use the construction given in $\text{Theorem 1.39}$ to convert the following two non-deterministic finite automata to equivalent deterministic finite automata.

| 46 views

+1 vote

a)

 a b 1 2 1,2 - 2 1

DFA transition table

 a b 1 [12] 2 Ф [12] [12] Ф Ф 2 [12] 1 Ф

in the DFA initial state is 1 and final states are 1 and [12]

by Active (3.9k points)