3 votes 3 votes Design NFA's to recognize the following sets of strings. $abc,abd,$ and $aacd.$ Assume the alphabet is $\{a,b,c,d\}$ $0101,101,$ and $011.$ Assume the alphabet is $\{0,1\}$ $ab,bc,$ and $ca.$ Assume the alphabet is $\{a,b,c\}$ Theory of Computation ullman theory-of-computation finite-automata + – admin asked Apr 3, 2019 edited Apr 5, 2019 by Lakshman Bhaiya admin 1.8k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.