Convert the following Moore Machine into a Mealy Machine. 90/1 a 92/0 a b b b 9₁/0 a 93/1 x a

Show that the circuit designed in part (a) can be simplified to a circuit consisting of three NOT gates, two 2-input AND gate and one 2-input OR gate. Draw and simulate your circuit in Quartus II and show that it functions properly according to the truth table.

Convert below circuit to (FPGA) block diagram.

Find the min and maxterm expansion of the circuit and develop a digital circuit that fits with the truth table.

draw the state diagram of 1001100 (moore, mealy machine) and provide the k map

3) Convert the following Moore Machine into a Mealy Machine. b 9₁/1 b 90/1 b a b 92/0 a 93/0 a

1. A. Convert A5Q(27)→ X(9) 2. Simplify the Karnaugh maps and draw the logic circuit. AB 00 01 11 10 CD 00 1 1 1 1 01 1 1 11 1 1 10 1 1 11 1 AB 00 01 11 10 CD 00 1 1 01 11 1 1 10 11 11 1 1