Theoretical Aspects of Lexical Analysis/Exercise 4

From Wiki**3

< Theoretical Aspects of Lexical Analysis
Revision as of 22:17, 21 March 2009 by Root (talk | contribs) (New page: Use Thompson's algorithm to build the NFA for the following regular expression. Build the corresponding DFA and minimize it. * <nowiki>(a|b)*abb(a|b)*</nowiki> == Solution == [[category...)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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

  • (a|b)*abb(a|b)*

Solution