Question: 27, 15 points Draw a minimal DFA which accepts the language L over the binary alphabet ? = a,b,c consisting of all strings which contain

27, 15 points Draw a minimal DFA which accepts the language L over the binary alphabet ? = a,b,c consisting of all strings which contain either aba or caa as a substring
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
