https://robots.hlt.inesc-id.pt/w/pt/index.php?action=history&feed=atom&title=Theoretical_Aspects_of_Lexical_Analysis%2FExercise_19 2026-05-23T01:32:34Z Revision history for this page on the wiki MediaWiki 1.43.3 https://robots.hlt.inesc-id.pt/w/pt/index.php?title=Theoretical_Aspects_of_Lexical_Analysis/Exercise_19&diff=6233&oldid=prev 2015-04-14T09:33:02Z

<p>Created page with &quot;__NOTOC__ Compute the non-deterministic finite automaton (NFA) by using Thompson&#039;s algorithm. Compute the minimal deterministic finite automaton (DFA).&lt;br/&gt;The alphabet is Σ...&quot;</p> <p><b>New page</b></p><div>__NOTOC__<br /> Compute the non-deterministic finite automaton (NFA) by using Thompson&#039;s algorithm. Compute the minimal deterministic finite automaton (DFA).&lt;br/&gt;The alphabet is Σ = { a, b, c }. Indicate the number of processing steps for the given input string. <br /> * &lt;nowiki&gt;G = { a*|b, b*|c, c*|a }&lt;/nowiki&gt;, input string = abbcac<br /> <br /> [[image:solution-nfa-dfa-ex19.jpg]]<br /> <br /> [[category:Compiladores]]<br /> [[category:Ensino]]<br /> <br /> [[en:Theoretical Aspects of Lexical Analysis]]</div>

Root