890 likes | 1.09k Views
Non Deterministic Automata. Nondeterministic Finite Accepter (NFA). Alphabet =. Nondeterministic Finite Accepter (NFA). Alphabet =. Two choices. Nondeterministic Finite Accepter (NFA). Alphabet =. Two choices. No transition. No transition. First Choice. First Choice. First Choice.
E N D
Nondeterministic Finite Accepter (NFA) Alphabet =
Nondeterministic Finite Accepter (NFA) Alphabet = Two choices
Nondeterministic Finite Accepter (NFA) Alphabet = Two choices No transition No transition
First Choice “accept”
Second Choice No transition: the automaton hangs
Second Choice “reject”
Observation An NFA accepts a string if there is a computation of the NFA that accepts the string
Example is accepted by the NFA:
“accept” String is accepted
Formal Definition of NFAs Set of states, i.e. Input aplhabet, i.e. Transition function Initial state Final states
Formally It holds if and only if there is a walk from to with label