Example
Let M be a NFA, with a binary alphabet, that determines if the input ends with a 1.
In formal notation, let M = ({p, q}, {0, 1}, Δ, p, {q}) where the transition relation Δ can be defined by this state transition table:
|
|
|
|
|
|
|
|
|
Note that Δ(p,1) has more than one state therefore M is nondeterministic. The language of M can be described by the regular language given by the regular expression (0|1)*1.
Read more about this topic: Nondeterministic Finite Automaton
Famous quotes containing the word example:
“Our intellect is not the most subtle, the most powerful, the most appropriate, instrument for revealing the truth. It is life that, little by little, example by example, permits us to see that what is most important to our heart, or to our mind, is learned not by reasoning but through other agencies. Then it is that the intellect, observing their superiority, abdicates its control to them upon reasoned grounds and agrees to become their collaborator and lackey.”
—Marcel Proust (1871–1922)