Find the minimized DFA table for the following DFA using the table filling ? algorithm B A a, b E A B C D E A B C A B CVX B M DVXX EVV b) a) A B C D E C D A A B B CX DVV C Xv DVVV EX X X X = If L= set of all string of length 3, the cardinality of the language L a) 3 b) 4 c) 6 d) 8 Design DFA for the following languages L = {w l w does not contains substring ab} *.over { ={a, b} a,b 90 qo 92 42 b) O a) a,b 90 91 b 92 - ? The Finite state machine can recognize a) any grammar b) only context-free grammar c) Both (b) and (c) d) Only regular grammar The following sequence of characters (bbbbaabab) ? a), b) 0 c)1 O d) O * The right linear grammar of the following machine is a, b a B a) BaB/bB/A AE b) BB/ bB / A B E c) B- aB/ bB/Aa A - O d) B Ba/Bb/Aa A E O ? Write the Conversion table the following NFA to DFA b a,b 2 a b a b 1 1, 2 2 1 1, 2 2 2 1, 2 1 20 1 b) O a) a b b 1 1, 2 2 a 1, 2 1 2 N 1, 2 1, 2 T 1 N * ? The regular expression a*(ab)*b* determine that ba is in the language or not a) ba a*(ab)*b* b) ba e a*(ab)*b* * ? The truth table after minimizing the following DFA is (AC 0 1 0 1 AC B E B DB E B AC D B AC AC B B B D E E B AC D B AC b) O a) AC B B B D B E B 1 AC AC E D 0 1 AC B AC B B D DB E E B AC