Section 9.3 Finite-State Machines
751
c. 0100110
2. a. For the machine described in Exercise la, find all input sequences yielding an output sequence of
0011110.
b. For the machine described in Exercise 1b, find all input sequences yielding an output sequence of
abaaca.
c. For the machine described in Exercise 1c, what will be the output for an input sequence a 1 a 2 a 3 a 4 a 5
where a i [ 50, 16, 1 ≤ i ≤ 5?
In Exercises 3–6, write the state table for the machine, and compute the output sequence for the given input
sequence.
3. 00110
5. 01011
6. acbabc
s 0 /0
s 2 /0
s 1 /1
a
b
a
c
a c
b, c
b
4. 1101100