1. Engineering
  2. Computer Science
  3. automata theory construct a dfa whose language is the set...

Question: automata theory construct a dfa whose language is the set...

Question details

Automata theory

Construct a DFA whose language is the set of strings over {a,b} which contain at least
two (possibly overlapping) copies of the substring bb.


For each state in your DFA, what is the set of strings which terminate in that state?

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution