Use the construction in the proof of Theorem 1.47 to give the state diagrams of NFAs recognizing the concatenation of the languages described in

a. Exercises 1.6g and 1.6i.

b. Exercises 1.6b and 1.6m.

Exercises 1.6

b. {w| w contains at least three 1s}

g. {w| the length of w is at most 5}

i. {w| every odd position of w is a 1}

m. The empty set

Construction in the proof of Theorem 1.47

Transcribed Image Text:

N1 N2 N w/ w w