Theoretical Aspects of Lexical Analysis/Exercise 3

From Wiki**3

< Theoretical Aspects of Lexical Analysis
Revision as of 20:18, 21 March 2009 by Root (talk | contribs)

Use Thompson's algorithm to build the NFA for the following regular expression. Build the corresponding DFA and minimize it.

  • ((ε|a)b)*

Solution

Retrieved from "https://www.hlt.inesc-id.pt/~david/wiki/pt/index.php?title=Theoretical_Aspects_of_Lexical_Analysis/Exercise_3&oldid=3044"