The Moore machine can also be represented by a table, where the table to represent the transition remains same as in FA , but there is a separate column (separated by a double line) to represent the output associated with each state. The tabular form of the Moore machine of the above example is given below.

		b
q0	q0	q1	0
q1	q2	q1	0
q2	q3	q1	0
q3	q0	q1	1

A Moore machine does not define a language of accepted strings, because in response to any input string it produces an output string and there is no concept of final states. The processing of the input string terminates when it outputs the symbol corresponding to the last input symbol.

For a given FA M , accepting the language L(M), if we associate 0 to any nonaccepting state and 1 to each accept state, then the 1's in any output sequence (produced in response to some input sequence) mark the ending of all sub strings of the input starting from the first symbol that are in L(M).