Question: Let M = ({ q 0 ,q 1 ,q 2 } , { a,b } ,,q 0 , { q 1 }) be the DFA

Let M = ({q0,q1,q2},{a,b},,q0,{q1}) be the DFA with transition table:

a

b

q0

q0

q1

q1

q1

q2

q2

q2

q2

The initial state is q0 and the set of accepting states is F = {q1}.[MN1]

  1. Construct the state diagram for M.
  2. Compute (q0,aab).
  3. Compute (q0,abb).
  4. Determine whether the word w = aab is accepted by M.
  5. Compute L(M).

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!