10. [10 points] Design NFA's to recognize the following set of strings and convert each of your NFA into its equivalent DFA. a. Iab, cab and dab. Assume the alphabet is { a , b , c , d , I } b. 1101,101 and 111. Assume the alphabet is { 0 , 1 } .
.
10- -10 points- Design NFA's to recognize the following set of strings.docx
1. 10. [10 points] Design NFA's to recognize the following set of strings and convert each of your
NFA into its equivalent DFA. a. Iab, cab and dab. Assume the alphabet is { a , b , c , d , I } b.
1101,101 and 111. Assume the alphabet is { 0 , 1 } .