Q1Theory of Computation
Question
2 marks
Define Finite Automata.
Answer
FA is a model of computation with finite states.
Finite Automata (FA) is a mathematical model of a system with finite number of states. It is a 5-tuple consisting of states, input symbols, transition function, start state, and final states.