automata help

3 Construct a reduced dfa for the following extended regular expression over the alphabet {0,1,2): [(2+1)*n 2(2*1)]* Note: Yo

3 Construct a reduced dfa for the following extended regular expression over the alphabet {0,1,2): [(2+1)*n 2(2*1)]* Note: You must first determine nfas for (2*1)* and 2(2*1)* over {0,1,2}, then handle the intersection and complementation, and then deal with the star. Finally reduce the resulting dfa. Consider de Morgan’s laws!



Source link

Leave a Reply

Your email address will not be published. Required fields are marked *