Metraipolis › archive › dc_40ecb137ff88
Automata theory — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Automata_theory
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-07T14:41:03.010Z
- SHA-256 of the archived text
29e40e123432d0bd1281fc6ae6275dbc2e0eeed8dd460911fda1211d467ab86b- Stable URL of this page
https://metraipolis.com/documento/dc_40ecb137ff88
How to cite
Automata theory — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Automata_theory (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_40ecb137ff88 (Metraipolis archive dc_40ecb137ff88, sha256 29e40e123432d0bd1281fc6ae6275dbc2e0eeed8dd460911fda1211d467ab86b)
BibTeX
@misc{dc40ecb137ff88,
title = {Automata theory — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Automata_theory},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_40ecb137ff88; sha256 29e40e123432d0bd1281fc6ae6275dbc2e0eeed8dd460911fda1211d467ab86b},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Automata_theory. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Automata theory is the study of abstract machines and automata, as well as the computational problems that can be solved using them. It is a theory in theoretical computer science with close connections to cognitive science and mathematical logic. The word automata comes from the Greek word αὐτόματος, which means "self-acting, self-willed, self-moving". An automaton (automata in plural) is an abstract self-propelled computing device which follows a predetermined sequence of operations automatically. An automaton with a finite number of states is called a finite automaton (FA) or finite-state machine (FSM). The figure on the right illustrates a finite-state machine, which is a well-known type of automaton. This automaton consists of states (represented in the figure by circles) and transitions (represented by arrows). As the automaton sees a symbol of input, it makes a transition (or jump) to another state, according to its transition function, which takes the previous state and current input symbol as its arguments. Automata theory is closely related to formal language theory. In this context, automata are used as finite representations of formal languages that may be infinite. Automata are often classified by the class of formal languages they can recognize, as in the Chomsky hierarchy, which describes a nesting relationship between major classes of automata. Automata play a major role in the theory of computation, compiler construction, artificial intelligence, parsing and formal verification. Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «information theory»). Fonte: Wikipedia in inglese, voce «Automata theory» — https://en.wikipedia.org/wiki/Automata_theory Wikidata Q214526 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q214526 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Automata_theory?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1369888203, consultata il 2026-10-07T14:14:35.354Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: aa6fdd6237b32166921660b1cd62442c600d2aaa48eb8d05d9656b17e9c2d4b9