Scribd Logo
Upload

Welcome to Scribd!

  • 6 views

    Problem

    Uploaded by

    Uday Narayan Goel
    The document describes two deterministic finite automata (DFAs) M1 and M2. It asks several questions about the start states, accept states, state sequences for the input string "aabb", and whether each DFA accepts "aabb" and the empty string. For M1, the start state is q0, the accept state is q1, it does not accept "aabb" but does not accept the empty string. For M2, the start state is q0, the accept states are q1 and q2, it accepts "aabb" and the empty string.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Problem

    Uploaded by

    Uday Narayan Goel
    6 views3 pages
    The document describes two deterministic finite automata (DFAs) M1 and M2. It asks several questions about the start states, accept states, state sequences for the input string "aabb", and whether each DFA accepts "aabb" and the empty string. For M1, the start state is q0, the accept state is q1, it does not accept "aabb" but does not accept the empty string. For M2, the start state is q0, the accept states are q1 and q2, it accepts "aabb" and the empty string.

    Original Description:

    Original Title

    1

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes two deterministic finite automata (DFAs) M1 and M2. It asks several questions about the start states, accept states, state sequences for the input string "aabb", and whether each DFA accepts "aabb" and the empty string. For M1, the start state is q0, the accept state is q1, it does not accept "aabb" but does not accept the empty string. For M2, the start state is q0, the accept states are q1 and q2, it accepts "aabb" and the empty string.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    6 views3 pages

    Problem

    Uploaded by

    Uday Narayan Goel
    The document describes two deterministic finite automata (DFAs) M1 and M2. It asks several questions about the start states, accept states, state sequences for the input string "aabb", and whether each DFA accepts "aabb" and the empty string. For M1, the start state is q0, the accept state is q1, it does not accept "aabb" but does not accept the empty string. For M2, the start state is q0, the accept states are q1 and q2, it accepts "aabb" and the empty string.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 3

    Problem

    The following are the state diagrams of two DFAs,M1 andM2. Answer the following questions about each of these machines.

    a. What is the start state?

    b. What is the set of accept states?

    c. What sequence of states does the machine go through on input aabb?

    d. Does the machine accept the string aabb?

    e. Does the machine accept the string "?

    Step-by-step solution

    Step 1 of 7

    State diagrams for two DFAs, and are

    Comment
    Step 2 of 7

    (a) Start state is indicated by the arrow pointing towards it.

    • For the DFA (Deterministic Finite Automata) , an arrow is pointing towards the state . So is the start state.

    • For the DFA , arrow is pointing towards the state . So is the start state.

    Comment

    Step 3 of 7

    (b) The accept state is the one which is identified by a double circle.

    • In state diagram of , the state has double circle. So is the accept state.

    • In the sate diagram of , the states and have double circles. So the set are the accept states.

    Comment

    Step 4 of 7

    (c)

    • When we given the string aabb as input to the machine then the following transitions will takes place

    (1) Start in state

    (2) Read a, follow transition from to

    (3) Read a, follow transition from to .

    (4) Read b, follow transition from to .

    (5) Read b, follow transition from to

    From (1), (2), (3), (4), (5)

    So the machine will go through following sequence of states on input aabb.

    • When we give the input aabb to machine then the following transitions will takes place

    (1) Start in state

    (2) Read a, follow transition from to

    (3) Read b, follow transition from to

    (5) Read b, follow transition from to

    From (1), (2), (3), (4), (5)

    The machine will go through the following sequence of states on input aabb

    Comment

    Step 5 of 7

    (d)

    • Machine will go through following sequence of sates on input aabb

    1. Start in state

    2. Read a, follow transition from to

    3. Read a, follow transition from to

    4. Read b, follow transition from to

    5. Read b, follow transition from to

    On reading the input aabb, finally entered into state , which is not an accept state.

    So reject the input aabb.

    • Machine will go through the following sequence of sates on input aabb


    1. Start in state

    2. Read a, follow transition from to

    3. Read a, follow transition from to

    4. Read b, follow transition from to

    5. Read b, follow transition from to

    On reading the input aabb, finally entered into state .

    accept state of .

    Hence accept the input aabb.

    Comment

    Step 6 of 7

    (e)

    • On giving the input (empty string) to machine , always in the start state .

    But in not the accept sate of .

    Thus does not accept the string

    Comment

    Step 7 of 7

    On giving the input (empty string) to the machine , always in the start state .

    But is also accept state of .

    Thus accept the string .

    Comment

    You might also like