Theoretical Aspects of Lexical Analysis/Exercise 25
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
| Solução completa |
|---|
|
|
