Theory of Computation - Old Questions
2. Give the DFA for language of strings over{a,b} where no two consecutive a’s occurred.
4 marks
|
Asked in 2068