Suppose the languages recognized by DFAs M and N are L1 and L2 respectively. How can we use DFAs M


Suppose the languages recognized by DFAs M and N are L1 and L2 respectively. How can we use DFAs M and N to construct a DFA that recognizes the language L1∩L2? [Can you use De Morgan’s Law?]


Leave a Reply

Your email address will not be published.