Question: Suppose that S = {A, B, ..., F} is a set of states and I = O = {0, 1} are the input and output

Suppose that S = {A, B, ..., F} is a set of states and I = O = {0, 1} are the input and output alphabets for the Mealy machine described by the transition table below. (a) Construct a state diagram for this Mealy machine. (Layout the states so that there is no need to have transition arrows crossing each other.) (b) Find the output string corresponding to the input string '0101011010011', when starting in state A. (c) Design a Moore machine which produces the same output as the Mealy machine in the previous question. In removing any inaccessible states, discuss which state or states are valid as the initial state; choosing that which keeps the total number of states to a minimum, if this is possible
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
