In theoretical computer science, automata theory is the study of abstract machines and problems 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 languages they are able to recognize.

Basic description

---

An automaton is a mathematical model for a finite state machine (FSM). An FSM is a machine that, given an input of symbols, jumps through a series of states according to a transition function (which can be expressed as a table). In the common "Mealy" variety of FSMs, this transition function tells the automaton which state to go to next given a current state and a current symbol.

The input is read symbol by symbol, until it is consumed completely (think of it as a tape with a word written on it, that is read by a reading head of the automaton; the head moves forward over the tape, reading one symbol at a time). Once the input is depleted, the automaton is said to have stopped.

More on [ Automata theory ]

Automata Theory - Twitter Search

automata-language-theory's quiz ruin all my mood messing up zzzzzz..
danangtrisatyo (Danang Trisatyo) Tue, 08 Dec 2009 05:17:50 -0000
automata-language-theory's quiz ruin all my mood messing up zzzzzz..
@woodsman12 well, in fact I know Noam Chomsky from my computer science studies (especially in compiler construction and automata theory)
timse7 (Christian Timmerer) Mon, 07 Dec 2009 22:02:22 -0000
@woodsman12 well, in fact I know Noam Chomsky from my computer science studies (especially in compiler construction and automata theory)
UPTU Syllabus | ECS-403 : THEORY OF AUTOMATA AND FORMAL LANGUAGES http://ff.im/-cvY7B
myindialist (My India List) Sun, 06 Dec 2009 14:39:42 -0000
UPTU Syllabus | ECS-403 : THEORY OF AUTOMATA AND FORMAL LANGUAGES http://ff.im/-cvY7B

Subscribe to Automata_Theory RSS feed