Theoretical Aspects of Lexical Analysis/Exercise 24

From Wiki**3

< Theoretical Aspects of Lexical Analysis

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*, bc*, a|c* }, input string = abbcac

Solução

[Expand] Solução completa

Solution-co-ex24-nfa-dfa.jpg Solution-co-ex24-dfa-graph-min-tree-graph.jpg Solution-co-ex24-input.jpg

Retrieved from "https://web.tecnico.ulisboa.pt/~david.matos/w/pt/index.php?title=Theoretical_Aspects_of_Lexical_Analysis/Exercise_24&oldid=9790"