1. Design a Moore machine that detects the sequence of 1101101. Please show the state
diagram, state table, and the final circuit using primitive gates (AND, OR, NOT, flip-flops,
etc.)
2. Design the sequence detector discussed in question 1 using a Mealy machine. Please show
the state diagram, state table, and the final circuit using primitive Please show the state
diagram, state table, and the final circuit using primitive gates (and, or, flip-flops, etc.).
3. Design a Moore machine whose output gets ‘1’ when either the last inputs are 101 or 1001.
Please only show the state diagram.
4. Design a Moore machine whose output becomes ‘1’ when the value of the input sequence
itself is a multiply of 3 (e.g., if input is 11010 then the output is 01100. In this example the
first input bit that feeds the state machine is ‘1’). Please only show the state diagram.
5. Design a Moore machine in which the output becomes 1 and remains 1 thereafter when at
least two 0s and at least two 1s have occurred as inputs, in any order. Please only show the
state diagram
0 comments