Theoretical Aspects of Lexical Analysis/Exercise 11

From Wiki**3

< Theoretical Aspects of Lexical Analysis
Revision as of 20:44, 23 April 2024 by Root (talk | contribs) (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 Σ...")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Compute the non-deterministic finite automaton (NFA) by using Thompson's algorithm. Compute the minimal deterministic finite automaton (DFA).
The alphabet is Σ = { a, b }. Indicate the number of processing steps for the given input string.

  • G = { a*b, a*, b*a }, input string = aababb

Solution

Solução completa

Asbasbsa1.jpg Asbasbsa2.jpg