Main Question:

Exercise $3\mathrm{.}25$ from the textbook $($Digital Design and Computer Architecture:

RISC$-$V Edition$).$ But it should detect the patterns $01011$ and $10110$ instead of the one given in the problem. Use $1-$hot state encoding. Remember that you could choose to use factored FSMs$.$ Remember this should be a Mealy FSM$.$

Required Question

Alyssa P$.$ Hacker$$s snail from Section $3\mathrm{.}4\mathrm{.}3$ has a daughter with a

Mealy machine FSM brain. The daughter snail smiles whenever she slides over

the pattern $1101$ or the pattern $1110.$ Sketch the state transition diagram for this

happy snail using as few states as possible. Choose state encodings and write a

combined state transition and output table, using your encodings. Write the next

state and output equations and sketch your FSM schematic.