https://robots.hlt.inesc-id.pt/w/pt/index.php?action=history&feed=atom&title=Theoretical_Aspects_of_Lexical_Analysis%2FExercise_14 2026-05-23T00:21:13Z 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_14&diff=14833&oldid=prev 2022-05-18T14:36:14Z

<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 }. Indicate the number of processing steps for the given input string. <br /> * &lt;nowiki&gt;G = { a*|b, a|b*, a* }&lt;/nowiki&gt;, input string = aababb<br /> <br /> [[image:co-ex13.jpg]]<br /> <br /> [[category:Compiladores]]<br /> [[category:Ensino]]<br /> <br /> [[en:Theoretical Aspects of Lexical Analysis]]</div>

Root