Question: 2 ( 4 points ) Let = { a , b } , L 1 = { w b a b | w i n
points Let
Draw the state diagram of a DFA that accepts the complement of Your state diagram should contain only four states.
points Draw the state diagram of a DFA that accepts the language of all strings over that contain the substring bab or the substring aba.Your finite automaton should not be overly complicated.
points Give the tuple definition of your DFA from problem
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
