Scribd
Upload
13 views9 pages

FSM Mealy

Uploaded by

soumya.bokare
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
13 views9 pages

FSM Mealy

Uploaded by

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

Finite State

Machine(FS
M)
Mealy m/c
Finite State Machine
• Finite state machine is used to recognize patterns.
• Finite automata machine takes the string of symbol as input and changes its state
accordingly. In the input, when a desired symbol is found then the transition
occurs.
• While transition, the automata can either move to the next state or stay in the
same state.
• FA has two states: accept state or reject state. When the input string is
successfully processed and the automata reached its final state then it will
accept.

3
2
Finite State Machine
Definition
A Finite State Machine is a model of computation based on a hypothetical machine made
of one or more states. Only one single state of this machine can be active at the same
time. It means the machine has to transition from one state to another in to perform
different actions.
The important points here are the following:
• We have a fixed set of states that the machine can be in
• The machine can only be in one state at a time
• A sequence of inputs is sent to the machine
• Every state has a set of transitions and every transition is associated with an input and
pointing to a state

3
FA With output

Moore Mealy
M/C M/C

3
4
Q. Construct a mealy machine for the given transition Table

3
5
Q. Construct a melay machine that takes binary number as inputs and
produces 1’s compliment of the number as output.

3
6
Q. Construct a melay machine that takes binary number as inputs and
produces 2’s compliment of the number as output. Assume the string is
read from LSB to MSB and end carry is discarded.

3
7
Q. Construct a melay machine to detect a sequence 1001 (non-
overlapping)

3
8
Q. Construct a melay machine for a binary sequence such that if it has
a substring 101, the m/c o/p’s A, if it receives substring 110 it o/p’s B,
else the ouput is C

3
9

You might also like