Finite Automata With Output

Example 1: Given state table as shown below that describes a finite-state machine with states Q = {q0 , q1 , q2 , q3}, input alphabet S = {0,1} and output alphabet O = {0, 1}, sketch the state diagram.

Solution: The given state table corresponds to finite-state machine with output. The corresponding state diagram is shown below.

Example 2: Give examples for Moore and Mealy Models of finite automata with outputs.

Solution: State Table shown in Fig. (a) represents a Moore Machine and that of Fig. (b) shows a Mealey Machine.