View source for Theoretical Aspects of Lexical Analysis/Exercise 17

__NOTOC__
Compute the non-deterministic finite automaton (NFA) by using Thompson's algorithm. Compute the minimal deterministic finite automaton (DFA).<br/>The alphabet is Σ = { a, b }. Indicate the number of processing steps for the given input string. 
* <nowiki>G = { a*, ba*, a*|b }</nowiki>, input string = aababb

== Solution ==

{{CollapsedCode|Solução completa|
[[Image:asbasasob1.jpg]]
[[Image:asbasasob2.jpg]]
}}

[[category:Compiladores]]
[[category:Ensino]]

[[en:Theoretical Aspects of Lexical Analysis]]