(a) Find the state table for the finite state machine in Fig. 6.8, where

(b) Let

with ||x|| = 4. If 1 is a suffix of w(s0, x), what are the possibilities for the string x ?
(c) Let A Š‚ {0, 1}* be the language where w(s0, x) has 1 as a suffix for all x in A. Determine A.
(d) Find the language A Š‚ {0, 1}* where w(s0, x) has 111 as a suffix for all x in A.

Transcribed Image Text:

0, 0 1, 0 0, 0 0, 0 Start So 0, 1 1, 0 1, 0 0, 0 0, 0 1, 0 Figure 6.8