Automata theory

from Wikipedia, the free encyclopedia

The automata theory is a branch of theoretical computer science that deals with the study of automata (model computers ) and with the problems that these automata can solve .

It is an important tool in computability theory and complexity theory . It finds practical application in the design of lexical scanners and parsers in compiler construction as well as for the design of programming languages .

Automata theory deals with formal languages and formal grammars , which, among other things, a. typified by the Chomsky hierarchy , and with models for automata that can process such languages, in particular finite automata , push-down automata , cellular automata, and Turing machines .

See also


Web links

Commons : Automata Theory  - collection of pictures, videos and audio files
Wiktionary: automata theory  - explanations of meanings, word origins, synonyms, translations