(Replaced content with "__NOTOC__ Compute the non-deterministic finite automaton (NFA) by using Thompson's algorithm. Compute the minimal deterministic finite automaton (DFA).<br/>The alphabet is...") |
(→Solution) |
||
Line 5: | Line 5: | ||
== Solution == | == Solution == | ||
+ | {{CollapsedCode|Solução completa| | ||
[[Image:asbasasob1.jpg]] | [[Image:asbasasob1.jpg]] | ||
[[Image:asbasasob2.jpg]] | [[Image:asbasasob2.jpg]] | ||
+ | }} | ||
[[category:Compiladores]] | [[category:Compiladores]] |
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.
Solução completa |
---|