Finite state machine is used to recognize patterns.Finite automata machine takes the string of symbol as input and changes its state accordingly. In the input, when a desired symbol is found then the transition occurs.
While transition, the automata can either move to the next state or stay in the same state.
FA has two states: accept state or reject state. When the input string is successfully processed and the automata reached its final state then it will accept.
