Root: 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 Σ = {..."

2018-07-06T07:59:09Z

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 Σ = {..."

New page

__NOTOC__
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]]

Theoretical Aspects of Lexical Analysis/Exercise 25 - Revision history

Root: 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 Σ = {..."

Root: 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 Σ = {..."