finite automata

(60 minutes to learn)


Finite automata are a formal model of computation with finite memory. The machine can be in any of a finite number of states, and it has rules for transitioning between states depending on its input. Finite automata can only perform fairly limited computations, such as matching regular expressions.


-this concept has no prerequisites-


  • formally define finite automata
  • be able to interpret state diagrams
  • be able to design finite automata to solve simple tasks

Core resources (read/watch one of the following)


Coursera: Automata
An introductory course on automata and the theory of computation.
Author: Jeffrey D. Ullman


See also

-No Additional Notes-