10. Construct the state diagram for the finite-state machine with the state
table shown below.
g
h
Input
Input
State
0
1
0
1
s 0
s 1
s 0
1
0
s 1
s 3
s 0
1
1
s 2
s 1
s 2
0
1
s 3
s 2
s 1
0
0
11. Construct the state table for the finite-state machine with the state
diagram shown below.
12. In a given coding algorithm, when three consecutive 1’s appear in a
message, the receiver of the message knows that there has been a
transmission error. Construct a finite state machine that gives a 1 as its
output but if and only if the last three bits received are all 1’s.
13. Obtain the state tables for the finite-state machines with the following
state diagrams.
(a)
102
Theory of Automata, Formal Languages and Computation
s 2
s 1
s 3
s 4
s 0
Start
1,1
1,0
0,0
0,0
0,0
1,0
1,0
s 1
s 0
s 2
s 3
Start
1,1
1,0
0,0
0,0
1,1
1,1
0,0
0,0