Difference between revisions of "Theoretical Aspects of Lexical Analysis/Exercise 23"
From Wiki**3
< Theoretical Aspects of Lexical Analysis
(Created page 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 Σ...") |
(→Solução) |
||
| (2 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
__NOTOC__ | __NOTOC__ | ||
| − | Compute the non-deterministic finite automaton (NFA) by using Thompson's algorithm. Compute the minimal deterministic finite automaton (DFA). | + | 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. |
* <nowiki>G = { a|b*, b|c*, a*c }</nowiki>, input string = abbcac | * <nowiki>G = { a|b*, b|c*, a*c }</nowiki>, input string = abbcac | ||
| 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]] | ||
}} | }} | ||
Latest revision as of 19:28, 17 April 2018
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.
- G = { a|b*, b|c*, a*c }, input string = abbcac
Solução
| Solução completa |
|---|
|
|
