For the following sequential circuit Find the nextstate equa
Solution
Finite automata may have outputs corresponding to each transition. There are two types of finite state machines that generate output
A Mealy Machine is an FSM whose output depends on the present state as well as the present input.
It can be described by a 6 tuple (Q, , O, , X, q0) where
Q is a finite set of states.
is a finite set of symbols called the input alphabet.
O is a finite set of symbols called the output alphabet.
is the input transition function where : Q × Q
X is the output transition function where X: Q O
q0 is the initial state from where any input is processed (q0 Q).
Moore machine is an FSM whose outputs depend on only the present state.
A Moore machine can be described by a 6 tuple (Q, , O, , X, q0) where
Q is a finite set of states.
is a finite set of symbols called the input alphabet.
O is a finite set of symbols called the output alphabet.
is the input transition function where : Q × Q
X is the output transition function where X: Q × O
q0 is the initial state from where any input is processed (q0 Q).
