Unformatted text preview: S= a k b k εL And u,v,w decomposition will have a non empty v composed entirely of ‘a’s If we pump v 0 times (uv i w  i=0), then a < b, the resulting string is not in L. So L is not regular. 4. There are two different ways that can be employed in solving this question. One can either figure out what this NFA represents and draw a minimized DFA for it, hence finding the number of equivalence classes, or convert the NFA to a DFA, minimize the result and find the number of equivalence classes that way. There are straightforward algorithms to convert an NFA to a DFA (page 178) and minimizing the DFA(pages 182188) in Sudkamp. Here we will see the second way since it is more rigorous....
View
Full Document
 Spring '08
 Staff
 Formal language, Formal languages, Regular expression, Contextfree grammar

Click to edit the document details