(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*)*</nowiki>) |
|||
| Line 2: | Line 2: | ||
* <nowiki>(a*|b*)*</nowiki> | * <nowiki>(a*|b*)*</nowiki> | ||
| + | |||
| + | [[category:Teaching]] | ||
| + | [[category:Compilers]] | ||
| + | [[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.