Ordered Quintuple Specification Of
Finite Automata:
A
finite state automaton, A can be specified by the entries in the following
ordered quintuple:
A
= ( Q , ∑ , δ ,
q0 , F)
Where
§ Q is finite
non-empty set of labels identifying the states of the machine,
∑ is a finite vocabulary of input or data symbols.
δ is the transition function of the machine which maps from δ : Q x ∑à Q
(Q x ∑ into Q)
q0 ϵ Q identifies the starting state of the machine and
F c Q is a set of accepting states or the final state.
∑ is a finite vocabulary of input or data symbols.
δ is the transition function of the machine which maps from δ : Q x ∑à Q
(Q x ∑ into Q)
q0 ϵ Q identifies the starting state of the machine and
F c Q is a set of accepting states or the final state.
No comments:
Post a Comment