Finite Automata is an abstract model / machine used for computing. It consists of finite number of states, input symbols and transitions. They read input symbols one by one, transitioning between states based on a set of rules. It ends in a final state after processing the input and then the input is accepted otherwise rejected. Finite Automata are used in compiler design , pattern matching , text processing etc.
