Discrete Mathematics and Its Applications, Seventh Edition

Published by McGraw-Hill Education
ISBN 10: 0073383090
ISBN 13: 978-0-07338-309-5

Chapter 13 - Section 13.2 - Finite-State Machines with Output - Exercises - Page 865: 21

Answer

Constructing the state table for Moore machine with the state diagram

Work Step by Step

Constructing a state Diagram --Each input string to a Moore machine M produces an output string. - In particular, the output corresponding to the input string $a_1a_2....a_k$ is the string $g(s_o)g(s_1)...g(s_k), where $ $s_i=f(s_{i-1},a_i) $ for i=1,2,...k.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.