2. FINITE AUTOMATA
M={Q, ∑, δ,q0,F}
M-finite automata
Q-set of states
∑-inputs
δ-transition function(δ(Q* ∑)->Q)
q0-initial state
F-final state
this is a formal definition for finite automata.
Deterministic finite automata(DFA) can also
be represented by same 5 tuples.
3. NON DETERMINISTIC FINITE AUTOMATA(NFA)
M={Q, ∑, δ,q0,F}
Q-set of states
∑-inputs
δ-transition function(δ(Q* ∑)->2^Q)
q0-initial state
F-final state
Here the NFA it accepts same input as more
time.
This is the major difference between DFA and
NFA
The NFA with epsilon also denoted like this.
But there is transition function is
δ’(Q* ∑*)->2^Q
5. P={Q, ∑, δ,q0,F,Π,Z0}
Q->set of states
∑->input symbol
δ->transition function
q0->initial state
F->final state
Π->finite stack symbols
Z0->starting symbol of stack
This is formal definition of PDA.