Automata
E1560598
UNEXPLORED
Automata is an ancient Greek treatise by Hero of Alexandria that describes self-operating mechanical devices and early forms of automation.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Automata canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T22895431 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Automata Context triple: [Hero of Alexandria, notableWork, Automata]
-
A.
Büchi automata
Büchi automata are a type of ω-automaton used to recognize languages of infinite words, playing a central role in the automata-theoretic approach to model checking and the semantics of linear temporal logic.
-
B.
Automata and Computability (textbook)
Automata and Computability is a widely used theoretical computer science textbook by Dexter Kozen that introduces formal languages, automata theory, and the foundations of computability.
-
C.
Automata Theory
Automata Theory is a branch of theoretical computer science that studies abstract computational models and the problems they can solve, forming a foundation for formal languages, compilers, and complexity theory.
-
D.
"Introduction to Automata Theory, Languages, and Computation"
"Introduction to Automata Theory, Languages, and Computation" is a foundational textbook in theoretical computer science that systematically develops the theory of automata, formal languages, and computational complexity.
-
E.
Finite Automata and Their Decision Problems
"Finite Automata and Their Decision Problems" is a landmark 1959 paper by Dana Scott and Michael Rabin that founded the modern theory of finite automata and formalized key decision problems in automata theory and computation.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Automata Target entity description: Automata is an ancient Greek treatise by Hero of Alexandria that describes self-operating mechanical devices and early forms of automation.
-
A.
Büchi automata
Büchi automata are a type of ω-automaton used to recognize languages of infinite words, playing a central role in the automata-theoretic approach to model checking and the semantics of linear temporal logic.
-
B.
Automata and Computability (textbook)
Automata and Computability is a widely used theoretical computer science textbook by Dexter Kozen that introduces formal languages, automata theory, and the foundations of computability.
-
C.
Automata Theory
Automata Theory is a branch of theoretical computer science that studies abstract computational models and the problems they can solve, forming a foundation for formal languages, compilers, and complexity theory.
-
D.
"Introduction to Automata Theory, Languages, and Computation"
"Introduction to Automata Theory, Languages, and Computation" is a foundational textbook in theoretical computer science that systematically develops the theory of automata, formal languages, and computational complexity.
-
E.
Finite Automata and Their Decision Problems
"Finite Automata and Their Decision Problems" is a landmark 1959 paper by Dana Scott and Michael Rabin that founded the modern theory of finite automata and formalized key decision problems in automata theory and computation.
- F. None of above. chosen
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.