Build a DFA that accepts the described language: The set of strings over {a, b} that do not contain the substring aaa. (Hint: de
sign a DFA to accept the complement of the language. Then interchange the accepting and non-accepting states. Make sure that you build a DFA, not an NFA, for this problem.)
1 answer:
Answer:
See explaination
Explanation:
A DFA that accepts the language which doesnt have a string with the following substring 'aaa'
The first step towards achieving this is to create DFA that accepts strings with substring aaa.
The next thing is to make all accepting states to non accepting states and non accepting states to accepting states.
Please kindly refer to attachment for step by step explaination.
You might be interested in