Theoretical Aspects of Lexical Analysis/Exercise 23: Difference between revisions
From Wiki**3
Created page with "__NOTOC__ Compute the non-deterministic finite automaton (NFA) by using Thompson's algorithm. Compute the minimal deterministic finite automaton (DFA).<br/>The alphabet is Σ..." |
No edit summary |
||
| Line 1: | Line 1: | ||
__NOTOC__ | __NOTOC__ | ||
Compute the non-deterministic finite automaton (NFA) by using Thompson's algorithm. Compute the minimal deterministic finite automaton (DFA). | 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 | * <nowiki>G = { a|b*, b|c*, a*c }</nowiki>, input string = abbcac | ||
Revision as of 16:48, 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 |
|---|
