Question: 2 ( 4 points ) Let = { a , b } , L 1 = { w b a b | w i n

2(4 points) Let ={a,b},L1={wbab|win**}.
Draw the state diagram of a DFA that accepts the complement of L1. Your state diagram should contain only four states.
3(4 points) Draw the state diagram of a DFA that accepts the language of all strings over {a,b} that contain the sub-string bab or the sub-string aba.Your finite automaton should not be overly complicated.
4(3 points) Give the 5-tuple definition of your DFA from problem 3.
 2(4 points) Let ={a,b},L1={wbab|win**}. Draw the state diagram of a DFA

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!