(→Solução) |
|||
(One intermediate revision by the same user not shown) | |||
Line 6: | Line 6: | ||
{{CollapsedCode|Solução completa| | {{CollapsedCode|Solução completa| | ||
− | [[image:solution-nfa-dfa-ex23.jpg]] | + | [[image:solution-co-ex23-nfa-dfa.jpg]] |
+ | [[image:solution-co-ex23-dfa-graph-min-tree-graph.jpg]] | ||
+ | [[image:solution-co-ex23-input.jpg|300px]] | ||
}} | }} | ||
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 |
---|