Ask a Teacher

Search



Explain Finite Automata?

A finite automaton (FA) is a simple idealized machine used to recognize patterns within input taken from some character set (or alphabet) C. The job of an FA is to accept or reject an input depending on whether the pattern defined by the FA occurs in the input.

A finite automaton consists of:

          a finite set S of N states
          a special start state
          a set of final (or accepting) states
          a set of transitions T from one state to another, labeled with chars in C.


comments powered by Disqus