Scribd
Upload
63 views2 pages

Mid Sem Questions

Finite automata are abstract machines that can be in one of a finite number of states. They read an input and transition between states based on that input, eventually producing an output. There are two main types: Moore and Mealy machines. Moore machines produce an output based solely on the current state, while Mealy machines produce an output based on the current state and current input. Converting between Moore and Mealy machines is possible by changing how the output is defined. Several examples are provided to illustrate finite automata concepts and how they can be used to recognize patterns in input strings.

Uploaded by

Yashraj Kushwah
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
63 views2 pages

Mid Sem Questions

Finite automata are abstract machines that can be in one of a finite number of states. They read an input and transition between states based on that input, eventually producing an output. There are two main types: Moore and Mealy machines. Moore machines produce an output based solely on the current state, while Mealy machines produce an output based on the current state and current input. Converting between Moore and Mealy machines is possible by changing how the output is defined. Several examples are provided to illustrate finite automata concepts and how they can be used to recognize patterns in input strings.

Uploaded by

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

Mid Sem Questions

1. What is finite automata? What are the essential features of the finite automata. Explain the
different types of finite automata with the help of examples and their applications.
2. Explain the mathematical description of the Moore and Mealy machines with help of
example. Also, show with help of an example that how the Mealy and Moore machines are
differ with each other in their output function.
3. For the following Moore machine, the input alphabet is Σ = {a, b}, and output alphabet is Δ
= {0, 1}. Run the following input sequences and find the respective outputs and current states:
a. aabab
b. abbb
c. ababb

States a b O/P
q0 q1 q2 0
q1 q2 q3 0
q2 q3 q4 1
q3 q4 q4 0
q4 q0 q0 0

4. Design a Moore machine to count occurrence of “abb” as substring. The machine will provide
output 1 for the “abb”, in other cases it provides output 0.

5. Answer the following questions with proper justification for the given state transition table of
Moore machine:
a. Draw the state transition graph for the given machine.
b. Show step-by-step transitions for the input strings “0111” and “0011” and provides
the output strings for the given string.
c. What will be the output strings in Mealy machine for same input strings.
d. Convert the given Moore machine into the Mealy machine. Also show the state
transition graph of the converted mealy machine.

Transition Table
Next State O/P
States Input =
Input = 0 ∆
1
q0 q3 q1 0
q1 q1 q2 1
q2 q2 q3 0
q3 q3 q0 0

6. Show the step-by-step procedure for converting the following Mealy machine into the Moore
machine. After conversion show the state transition table of the converted Moore machine.
Also, check the validity of converted Moore machine by passing a string that both Mealy and
Moore are providing same output.
7. Design the mealy machine that provides output 1 when the sequences “aa” or “bb”
encountered in any input binary string over the alphabet Σ = {a, b}, otherwise provide output
0. Also, design the equivalent Moore machine.

You might also like