Finite automata
Finite automata is a machine which recognize the pattern . It can be defined using five tuples. Finite set of states. Finite set of alphabet or input. Transition function which show the transmission of input alphabet from one state to another state. Initial state and final state.
- Finite automata with output.
- Moore machine : Its output values are determine by its current state.
- Mealy machine : Its output values are determine by both its current state and current input.
- Finite automata without output.
- DFA
- NFA
- epsilon -NFA
It's stand for deterministic finite automata. transition takes place for a input only from one state to another one state .It can be defined using five tuples.
EXAMPLE:
NFA :
Its stand for non-deterministic finite automata.
the state where machine will move cannot be determine .hence it is known as NFA.
for a particular input transition can be possible to any combination of states.
it can be defined using five tuples.
EXAMPLE:
epsilon-NFA
It is a collection of all states to which their is a transition of input signal epsilon from state.
That is transition from one state to another state with input epsilon in known as epsilon-NFA.
EXAMPLE:
