(Created page with "__NOTOC__ Compute the non-deterministic finite automaton (NFA) by using Thompson's algorithm. Compute the minimal deterministic finite automaton (DFA). The alphabet is Σ = {...") |
(→Solução) |
||
Line 8: | Line 8: | ||
[[image:solution-co-ex24-nfa-dfa.jpg]] | [[image:solution-co-ex24-nfa-dfa.jpg]] | ||
[[image:solution-co-ex24-dfa-graph-min-tree-graph.jpg]] | [[image:solution-co-ex24-dfa-graph-min-tree-graph.jpg]] | ||
− | [[image:solution-co-ex24-input.jpg | + | [[image:solution-co-ex24-input.jpg]] |
}} | }} | ||
Compute the non-deterministic finite automaton (NFA) by using Thompson's algorithm. Compute the minimal deterministic finite automaton (DFA). The alphabet is Σ = { a, b, c }. Indicate the number of processing steps for the given input string.
Solução completa |
---|