QUESTION 11 Below is transition table of a DFA with 4 states. a b Start S 1 2 1 3 2 3 Final 3 3 23 How many states are i

[answerhappygod]

Question 11 Below Is Transition Table Of A Dfa With 4 States A B Start S 1 2 1 3 2 3 Final 3 3 23 How Many States Are I 1 (41.38 KiB) Viewed 45 times

QUESTION 11 Below is transition table of a DFA with 4 states. a b Start S 1 2 1 3 2 3 Final 3 3 23 How many states are in the equivalent minimum state DFA? 02 O 33 3 1 The DFA cannot be minimized QUESTION 12 A is an alphabet, A = (a,b). L is a language consisting of all the strings that contains at least one 'a' Which of the following represents the appropriate grammar for L ? S-> TaT | A T->bT | A S -> TaT T->bT | aT | A S-> TaT T->bT | b S-> SaS | A