Chapter 13.2, Problem 19E

Construct a finite-state machine that determines whether the word computer has been read as the last eight characters in the input read so far, where the input can be any string of English letters.

A Moore machine $M=\left(S,I,O,f,g,s_0\right)$ consists of a finite set of states, an input alphabet I, an output alphabet 0, a transition function f that assigns a next state to every pair of a state and an input, an output function g that assigns an output to every state, and a starting state so. A Moore machine can be represented either by a table listing the transitions for each pair of state and input and the outputs for each state, or by a diagram that displays the states, the transitions between states, and the output for each state. In the diagram, transitions are indicated with arrows labeled with the input, and the outputs are shown next to the states.