Home > Theory Of Computation > NFA: Introduction About Non-Deterministic Finite Automata(NFA)

# NFA: Introduction About Non-Deterministic Finite Automata(NFA) Introduction About Non-Deterministic Finite Automata(NFA) – Non-Deterministic Finite Automata Is A Incomplete System. The Non-Deterministic Finite Automata Which Has Zero, One Or More Than One Transition From Any State For Any Input Symbol Is Called Non-Deterministic Automata.

## Non-Deterministic Finite Automata Is 5 Tuple Machine.

M={Q.Σ,δ,q0,F}

Q-Set Of States

Σ-Set Of Input Alphabets

δ-Transition Function

Q×Σ-2Q

q0-Initial State

F- Set Of Final States

## Difference Between NFA & DFA

Every NFA Is DFA But Every DFA Is Not Non-Deterministic Finite Automata.

Non-Deterministic Finite Automata Is Used To Construct For Bussiness Models

Non-Deterministic Finite Automata Is Called As Parallel Computational Method Or Parallel Trade Generator Machine.

DFA’s Output Is Determined, NFA‘S Output Is Not Determined.

Non-Deterministic Finite Automata Is Not Used In Real Time.

## Non-Deterministic Finite Automata Example

Construct Non-Deterministic Finite Automata Which Accepts Set Of All Strings Which Starts With 0 And Ends With 1

Σ={0,1}

L={01,0101,001101….}

NFA 