Theoretical Aspects of Lexical Analysis/Exercise 25: Difference between revisions

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). The alphabet is Σ = {...")
 
 
Line 1: Line 1:
__NOTOC__
#REDIRECT [[ist:Theoretical Aspects of Lexical Analysis/Exercise 25]]
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
 
== Solução ==
 
{{CollapsedCode|Solução completa|
[[image:solution-co-ex25-nfa-dfa.jpg]]
[[image:solution-co-ex25-dfa-graph-min-tree-graph-input.jpg]]
}}
 
[[category:Compiladores]]
[[category:Ensino]]
 
[[en:Theoretical Aspects of Lexical Analysis]]

Latest revision as of 22:05, 5 December 2018

Redirect to:

Retrieved from "https://www.hlt.inesc-id.pt/~david/wiki/pt/index.php?title=Theoretical_Aspects_of_Lexical_Analysis/Exercise_25&oldid=10995"