Use Thompson's algorithm to build the NFA for the following regular expression. Build the corresponding DFA and minimize it.
- (a*|b*)*
(→DFA) |
|||
(3 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
+ | __NOTOC__ | ||
+ | <div class="section-container auto" data-section> | ||
+ | <div class="section"> | ||
+ | <p class="title" data-section-title>Problem</p> | ||
+ | <div class="content" data-section-content> | ||
+ | <!-- ====================== START OF PROBLEM ====================== --> | ||
Use Thompson's algorithm to build the NFA for the following regular expression. Build the corresponding DFA and minimize it. | Use Thompson's algorithm to build the NFA for the following regular expression. Build the corresponding DFA and minimize it. | ||
− | * <nowiki>(a*|b*)*</nowiki> | + | * '''<nowiki>(a*|b*)*</nowiki>''' |
− | + | <!-- ====================== END OF PROBLEM ====================== --> | |
− | == Solution == | + | </div> |
− | + | </div> | |
− | === | + | <div class="section"> |
− | + | <p class="title" data-section-title>Solution</p> | |
− | The | + | <div class="content" data-section-content> |
− | + | <!-- ====================== START OF SOLUTION ====================== --> | |
− | < | + | The non-deterministic finite automaton (NFA), built by applying Thompson's algorithm to the regular expression '''<nowiki>(a*|b*)*</nowiki>''' is the following: |
+ | <dot-hack> | ||
digraph nfa { | digraph nfa { | ||
{ node [shape=circle style=invis] start } | { node [shape=circle style=invis] start } | ||
Line 28: | Line 35: | ||
10 -> 1; 10 -> 11 | 10 -> 1; 10 -> 11 | ||
fontsize=10 | fontsize=10 | ||
− | |||
} | } | ||
− | </ | + | </dot-hack> |
− | |||
− | |||
− | |||
− | |||
+ | Applying the determination algorithm to the above NFA, the following determination table is obtained: | ||
{| cellspacing="2" | {| cellspacing="2" | ||
! style="padding-left: 20px; padding-right: 20px; background: wheat;" | I<sub>n</sub> | ! style="padding-left: 20px; padding-right: 20px; background: wheat;" | I<sub>n</sub> | ||
Line 85: | Line 88: | ||
! style="font-weight: normal; align: center; background: #e6e6e6;" | '''2''' | ! style="font-weight: normal; align: center; background: #e6e6e6;" | '''2''' | ||
|} | |} | ||
− | |||
{| width="100%" | {| width="100%" | ||
! style="text-align: left; font-weight:normal; vertical-align: top; width: 50%;" |Graphically, the DFA is represented as follows: | ! style="text-align: left; font-weight:normal; vertical-align: top; width: 50%;" |Graphically, the DFA is represented as follows: | ||
− | + | <dot-hack> | |
− | < | ||
digraph dfa { | digraph dfa { | ||
{ node [shape=circle style=invis] start } | { node [shape=circle style=invis] start } | ||
Line 104: | Line 105: | ||
2 -> 2 [label="b"] | 2 -> 2 [label="b"] | ||
fontsize=10 | fontsize=10 | ||
− | |||
} | } | ||
− | </ | + | </dot-hack> |
Given the minimization tree to the right, the final minimal DFA is: | Given the minimization tree to the right, the final minimal DFA is: | ||
− | < | + | <dot-hack> |
digraph dfamin { | digraph dfamin { | ||
{ node [shape=circle style=invis] start } | { node [shape=circle style=invis] start } | ||
Line 119: | Line 119: | ||
012 -> 012 [label="b"] | 012 -> 012 [label="b"] | ||
fontsize=10 | fontsize=10 | ||
− | |||
} | } | ||
− | </ | + | </dot-hack> |
! style="text-align: left; font-weight:normal; vertical-align: top; width: 50%;" | The minimization tree is as follows. As can be seen, the states are indistinguishable. | ! style="text-align: left; font-weight:normal; vertical-align: top; width: 50%;" | The minimization tree is as follows. As can be seen, the states are indistinguishable. | ||
− | < | + | <dot-hack> |
digraph mintree { | digraph mintree { | ||
node [shape=none,fixedsize=true,width=0.2,fontsize=10] | node [shape=none,fixedsize=true,width=0.2,fontsize=10] | ||
Line 132: | Line 131: | ||
"{0, 1, 2}" -> "{0, 1, 2} " [label=" a,b",fontsize=10] | "{0, 1, 2}" -> "{0, 1, 2} " [label=" a,b",fontsize=10] | ||
fontsize=10 | fontsize=10 | ||
− | |||
} | } | ||
− | </ | + | </dot-hack> |
|} | |} | ||
+ | <!-- ====================== END OF SOLUTION ====================== --> | ||
+ | </div> | ||
+ | </div> | ||
+ | </div> | ||
+ | |||
+ | [[category:Compiladores]] | ||
+ | [[category:Ensino]] | ||
− | |||
− | |||
[[en:Theoretical Aspects of Lexical Analysis]] | [[en:Theoretical Aspects of Lexical Analysis]] |
Problem
Use Thompson's algorithm to build the NFA for the following regular expression. Build the corresponding DFA and minimize it.
Solution
The non-deterministic finite automaton (NFA), built by applying Thompson's algorithm to the regular expression (a*|b*)* is the following:
Applying the determination algorithm to the above NFA, the following determination table is obtained:
In | α∈Σ | move(In, α) | ε-closure(move(In, α)) | In+1 = ε-closure(move(In, α)) |
---|---|---|---|---|
- | - | 0 | 0, 1, 2, 3, 5, 6, 7, 9, 10, 11 | 0 |
0 | a | 4 | 1, 2, 3, 4, 5, 6, 7, 9, 10, 11 | 1 |
0 | b | 8 | 1, 2, 3, 5, 6, 7, 8, 9, 10, 11 | 2 |
1 | a | 4 | 1, 2, 3, 4, 5, 6, 7, 9, 10, 11 | 1 |
1 | b | 8 | 1, 2, 3, 5, 6, 7, 8, 9, 10, 11 | 2 |
2 | a | 4 | 1, 2, 3, 4, 5, 6, 7, 9, 10, 11 | 1 |
2 | b | 8 | 1, 2, 3, 5, 6, 7, 8, 9, 10, 11 | 2 |
Graphically, the DFA is represented as follows:
Given the minimization tree to the right, the final minimal DFA is: |
The minimization tree is as follows. As can be seen, the states are indistinguishable. |
---|