the BW TNFAC Draw NFA diagrams using the fewest numbers of states that realize the following...

 

Transcribed Image Text:

the BW TNFAC Draw NFA diagrams using the fewest numbers of states that realize the following languages. Assume = (0, 1): (a) A = {xx ends with 001}. (b) B= {xx contains 001}. (c) C = { contains neither 01 nor 10 as substring}. (Hint: think of the complement of this language.) the BW TNFAC Draw NFA diagrams using the fewest numbers of states that realize the following languages. Assume = (0, 1): (a) A = {xx ends with 001}. (b) B= {xx contains 001}. (c) C = { contains neither 01 nor 10 as substring}. (Hint: think of the complement of this language.)