Line 2: | Line 2: | ||
* <nowiki>((ε|a)b)*</nowiki> | * <nowiki>((ε|a)b)*</nowiki> | ||
+ | |||
+ | == Solution == | ||
[[category:Teaching]] | [[category:Teaching]] | ||
[[category:Compilers]] | [[category:Compilers]] | ||
[[en:Theoretical Aspects of Lexical Analysis]] | [[en:Theoretical Aspects of Lexical Analysis]] |
Use Thompson's algorithm to build the NFA for the following regular expression. Build the corresponding DFA and minimize it.