Theoretical Aspects of Lexical Analysis/Exercise 20: Difference between revisions
From Wiki**3
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 Σ..." |
No edit summary |
||
| Line 3: | Line 3: | ||
* <nowiki>G = { a|b*, b|c*, a*|c }</nowiki>, input string = abbcac | * <nowiki>G = { a|b*, b|c*, a*|c }</nowiki>, input string = abbcac | ||
== Solução == | |||
{{CollapsedCode|Solução completa| | |||
[[image:solution-nfa-dfa-ex20.jpg]] | [[image:solution-nfa-dfa-ex20.jpg]] | ||
}} | |||
[[category:Compiladores]] | [[category:Compiladores]] | ||
Latest revision as of 15:29, 10 April 2016
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 |
|---|
|
|
