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

From Wiki**3

< Theoretical Aspects of Lexical Analysis
← Older editNewer edit →
Root (talk | contribs)
PRIVATE, Bureaucrats, Administrators
15,362 edits
No edit summary
Root (talk | contribs)
PRIVATE, Bureaucrats, Administrators
15,362 edits
Line 6: Line 6:


{{CollapsedCode|Solução completa|
{{CollapsedCode|Solução completa|
[[image:solution-nfa-dfa-ex23.jpg]]
[[image:solution-co-ex23-nfa-dfa.jpg]]
[[image:solution-co-ex23-dfa-graph-min-tree-graph.jpg]]
[[image:solution-co-ex23-input.jpg]]
}}
}}


Revision as of 17:23, 17 April 2018

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.

  • G = { a|b*, b|c*, a*c }, input string = abbcac

Solução

Solução completa

Retrieved from "https://robots.hlt.inesc-id.pt/w/pt/index.php?title=Theoretical_Aspects_of_Lexical_Analysis/Exercise_23&oldid=9777"