sanyamarora2810

Let = {a, b, c} . For each of the languages below on , draw the transition diagram of an NFA that accepts it.

(a) L = {w: w does not contain all three letters of the alphabet }

(b) L = {w: w contains the substring aa and ends with bb}

(c) L = {w: w contains the substring aa and ends with ab}