Nondeterministic Finite Automaton - Variations of NFA

Variations of NFA

  • Deterministic finite automaton(DFA): In this automaton, for each state and alphabet, the transition relation has exactly one state.
  • Nondeterministic finite automaton with ε-moves(NFA-ε): This automaton replaces the transition relation with the one that allows the empty string ε as a possible input, so the transition relation is defined as Δ : Q × (Σ ∪{ε}) → P(Q).

Read more about this topic:  Nondeterministic Finite Automaton

Famous quotes containing the word variations:

    “I may be able to spot arrowheads on the desert but a refrigerator is a jungle in which I am easily lost. My wife, however, will unerringly point out that the cheese or the leftover roast is hiding right in front of my eyes. Hundreds of such experiences convince me that men and women often inhabit quite different visual worlds. These are differences which cannot be attributed to variations in visual acuity. Man and women simply have learned to use their eyes in very different ways.”
    —Edward T. Hall (b. 1914)