Scribd
Upload
53 views4 pages

Assisgnment Questions

The document contains 12 questions about finite state automata. Questions 1-5 ask the reader to analyze sample automata diagrams and transition tables to answer true/false statements and choose correct options. Questions 6-11 involve constructing equivalent deterministic or minimal automata from sample nondeterministic automata transition tables. Question 12 involves analyzing an epsilon-NFA, computing epsilon closures, listing accepted strings, and converting to a DFA.

Uploaded by

Arnab Banerjee
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
53 views4 pages

Assisgnment Questions

The document contains 12 questions about finite state automata. Questions 1-5 ask the reader to analyze sample automata diagrams and transition tables to answer true/false statements and choose correct options. Questions 6-11 involve constructing equivalent deterministic or minimal automata from sample nondeterministic automata transition tables. Question 12 involves analyzing an epsilon-NFA, computing epsilon closures, listing accepted strings, and converting to a DFA.

Uploaded by

Arnab Banerjee
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Assignment Questions

1. Study the automaton given in the following figure and choose the correct answers to
the questions 1-5.

a.

b.

c.

d.

e.
2. Study the automaton given in the following figure and state whether the statements
are true or false.

a. M is a nondeterministic automaton
b. δ(q1, 1) is defined
c. 0100111 is accepted by M
d. 010101010 is not accepted by M
e. δ(q0, 01001) = {q1}
f. δ(q0, 011000) = {q0, q1, q2}
g. δ(q2, w) = q2 for any string w ϵ {0,1}*
h. δ(q1, 11001) ≠ Ø
i. A string having an even number of 0’s is accepted by M

3. Design a DFA to accept the following strings over the alphabet {0,1}:
a. Set of all strings beginning with 101
b. Set of all strings containing 1101 as a substring
c. Set of all strings with exactly three consecutive 0’s
d. Set of all strings not containing 110
e. Set of all strings that begin with 01 and end with 11

4. Design a NFA to accept the following strings over the alphabet {0,1}:
a. Set of all strings containing either 101 or 110 as substring
b. Set of all strings such that every 1 is followed immediately by 00
c. Set of all strings containing exactly two occurrences of 10

5. Construct the minimum state automaton equivalent to the transition diagram give in
the following figure.
6. The transition table of a nondeterministic finite automaton M is given in the following
table. Construct a deterministic finite automaton equivalent to M.

State 0 1 2
→q0 q1q4 q4 q2q3
q1 q4
q2 q2q3
q3 q4
*q4

7. Construct a minimum state automaton equivalent to a given automaton M whose


transition table is defined by the following table.

8. Construct a Mealy Machine which is equivalent to the Moore Machine defined by the
following table.

9. Construct a Moore Machine which is equivalent to the Mealy Machine defined by the
following table.
10. Construct a Mealy machine which can output EVEN, ODD according as the total
number of 1’s encountered is even or odd. The output symbols are 0 and 1.

11. Convert to a DFA the following NFA:


δ 0 1
→p {p,r} {q}
q {r,s} {p}
*r {p,s} {r}
*s {q,r} Ø

12. Consider the following ϵ-NFA:


δ ϵ a b
→p {r} {q} {p,r}
q Ø {p} Ø
*r {p,q} {r} {p}

a. Compute the ϵ-closure of each state.


b. Give the set of all strings of length 3 or less accepted by the automaton.
c. Convert the automaton to a DFA.

You might also like