Contents |
Use Thompson's algorithm to build the NFA for the following regular expression. Build the corresponding DFA and minimize it.
The non-deterministic finite automaton (NFA), built by applying Thompson's algorithm to the regular expression (a|b)*abb(a|b)* is the following:
NFA |
---|
|
Applying the determination algorithm to the above NFA, the following determination table is obtained:
Determination table |
---|
{{{2}}} |
Graphically, the DFA is represented as follows:
DFA |
---|
|
The minimization tree is as follows:
Minimization tree |
---|
Given the minimization tree above, the final minimal DFA is as follows:
Minimal DFA |
---|
|