- The Finite State Machine
Finite state machine FSM or finite state automaton plural: automata or simply a state machine, is a model of behavior composed of a finite number of states, transitions between those states, and actions. A finite state machine is an abstract model of ...
http://en.wikipedia.org/wiki/Finite_state_machine
| | - The Automata
Course notes from the University of Kentucky with sections on finite state automata, pushdown automata and linear bounded automata. [PDF] ...
http://www.cs.uky.edu/~lewis/texts/theory/automata/autointr.pdf
|
| |
| | - Finite Automata
Set of slides from History of Computers and Computing with basic information on automata. [PDF] ...
http://www.cs.nott.ac.uk/~tpp/G5AHOC/pdf/hoc7.pdf
|
| |
- Theory of Automata
Survey of finite state automata, pushdown automata, Turing machines and the languages accepted by these devices. [PDF] ...
http://www.geocities.com/kumar_rajen/automata.pdf
|
| |
- Automata Pushdown
We will now consider a new notion of automata pushdown automata PDA. PDAs are finite automatons with a stack, i.e. a data structure which can be used to store an arbitrary number of symbols hence PDAs have an infinite set of states but which can be o ...
http://www.cs.nott.ac.uk/~txa/g51mal.2001/notes/node29.html
| | - Automata Theory Wikipedia
theoretical computer science, automata theory is the study of abstract machines and problems which they are able to solve. Automata theory is closely related to formal language theory as the automata are often classified by the class of formal langua ...
http://en.wikipedia.org/wiki/Automata_theory
|
| |
- The Automata Theory
Automata are abstract mathematical models of machines that perform computations on an input by moving through a series of states or configurations. If the computation of an automaton reaches an accepting configuration it accepts that input. At each s ...
http://www.kornai.com/MatLing/aut.html
| | - Turing Machines
A brief survey of finite state automata, pushdown automata, linear bounded automata and Turing machines. ...
http://www.cs.princeton.edu/courses/archive/spr01/cs126/lectures/T2-4up.pdf...
|
| |
- Automata and Formal
Automata and Formal Languages terse statement of important definitions and theorems in this field of study. ...
http://carlstrom.com/stanford/comps/Automata-and-Formal-Languages.txt
| | - State Automata and Regular
The computations of programs are driven by their inputs. The outputs are just the results of the computations, and they have no influence on the course that the computations take. Consequently, it seems that much can be studied about finitestate tran ...
http://www.cse.ohio-state.edu/~gurari/theory-bk/theory-bk-twose3.html
|
| |
