A finite automata is a collection of 5-components or
tuple(Q,∑, δ,q0 ,F) where
Q is a finite set of states, which is non empty.
∑ is a input alphabet, indicates input set,
q0 is an initial state and q0 is
in Q i.e. q0є Q
F is a set of final states.
δ is a transition function or a mapping function. Using this
function the next state can be determined.
δ:Q x ∑ ->Q
No comments:
Post a Comment