Consider a language L over ∑={a,b} given below. The number of states in min…
Consider a language L over ∑={a,b} given below. The number of states in min DFA of L are ____:
L= {ax | x= 2y+3z | y,z ≥ 0 }
Answer: 4 — L= {ax | x= 2y+3z | y, z ≥ 0} Hence L={∊, aa, aaa, aaaa, aaaaa, aaaaaa, ...........} So, the required DFA will be
Attempted by 33 students.
Show answer & explanation
Correct answer: 4
L= {ax | x= 2y+3z | y, z ≥ 0}
Hence L={∊, aa, aaa, aaaa, aaaaa, aaaaaa, ...........}
So, the required DFA will be
Loading lesson…