See also:
  • http://www.cs.uky.edu/~lewis/texts/theory/automata/autointr.pdf
    Automata - Course notes from the University of Kentucky with sections on finite state automata, pushdown automata and linear bounded automata. [PDF]
  • http://carlstrom.com/stanford/comps/Automata-and-Formal-Languages.txt
    Automata and Formal Languages - A terse statement of important definitions and theorems in this field of study.
  • http://en.wikipedia.org/wiki/Automata_theory
    Automata Theory - Wikipedia article on finite state machines with links to articles about pushdown automata, linear bounded automata and Turing machines.
  • http://www.kornai.com/MatLing/aut.html
    Automata Theory - An essay by David Weir.
  • http://cscs.umich.edu/~crshalizi/notebooks/computation.html
    Computation, Automata, Languages - Notes, small essays, explanations, reading lists. By Cosma Rohilla Shalizi.
  • http://www.cs.nott.ac.uk/~tpp/G5AHOC/pdf/hoc7.pdf
    Finite Automata to Turing Machines - Set of slides from History of Computers and Computing with basic information on automata. [PDF]
  • http://en.wikipedia.org/wiki/Finite_state_machine
    Finite State Machine - Wikipedia article on FSA, Moore and Mealy machines.
  • http://osteele.com/tools/reanimator/
    reAnimator - A regular expression FSA visualizer that provides interactive visualization of how finite-state automata can be used to match regular expressions.
  • http://www.cs.princeton.edu/courses/archive/spr01/cs126/lectures/T2-4up.pdf#search=%22linear%20bounded%20automata%22
    Turing Machines - A brief survey of finite state automata, pushdown automata, linear bounded automata and Turing machines.