Theoretical Aspects of Lexical Analysis/Exercise 11: Difference between revisions
From Wiki**3
| Line 5: | Line 5: | ||
== Solution == | == Solution == | ||
Note that {1,3} in the minimization tree must still be checked. | |||
{{CollapsedCode|Solução completa| | {{CollapsedCode|Solução completa| | ||
[[Image:asbasbsa1.jpg]] | [[Image:asbasbsa1.jpg]] | ||
Latest revision as of 15:01, 27 April 2026
Compute the non-deterministic finite automaton (NFA) by using Thompson's algorithm. Compute the minimal deterministic finite automaton (DFA).
The alphabet is Σ = { a, b }. Indicate the number of processing steps for the given input string.
- G = { a*b, a*, b*a }, input string = aababb
Solution
Note that {1,3} in the minimization tree must still be checked.
| Solução completa |
|---|
|
|
