1.

What Is The Exact Definition Of Fa ?

Answer»

Definition: A Finite automaton (FA), is a collection of the followings

  • Finite number of states, having one initial and some (maybe none) final states.
  • Finite SET of input letters (Ó) from which input strings are formed.
  • Finite set of TRANSITIONS i.e. for each state and for each input letter there is a TRANSITION showing how to move from one state to another.

Definition: A Finite automaton (FA), is a collection of the followings


Discussion

No Comment Found

Related InterviewSolutions