Theoretical Aspects of Lexical Analysis/Exercise 23

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


Solução completa

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