Theoretical Aspects of Lexical Analysis/Exercise 23: Difference between revisions
From Wiki**3
| Line 8: | Line 8: | ||
[[image:solution-co-ex23-nfa-dfa.jpg]] | [[image:solution-co-ex23-nfa-dfa.jpg]] | ||
[[image:solution-co-ex23-dfa-graph-min-tree-graph.jpg]] | [[image:solution-co-ex23-dfa-graph-min-tree-graph.jpg]] | ||
[[image:solution-co-ex23-input.jpg]] | [[image:solution-co-ex23-input.jpg|300px]] | ||
}} | }} | ||
Latest revision as of 17: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 |
|---|
|
|
