Question - 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.