1 votes 1 votes Use the construction given in $\text{Theorem 1.39}$ to convert the following two non-deterministic finite automata to equivalent deterministic finite automata. Theory of Computation michael-sipser theory-of-computation finite-automata + – admin asked Apr 21, 2019 edited Apr 21, 2019 by Lakshman Bhaiya admin 4.4k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
4 votes 4 votes 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] aditi19 answered May 17, 2019 aditi19 comment Share Follow See all 0 reply Please log in or register to add a comment.