Finite Automata and Their Decision Problems
E755394
"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.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Finite Automata and Their Decision Problems canonical | 2 |
How this entity was disambiguated
This entity first appeared as the object of triple T8751935 — 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: Finite Automata and Their Decision Problems Context triple: [Dana Scott, notableWork, Finite Automata and Their Decision Problems]
-
A.
Elements of the Theory of Computation
Elements of the Theory of Computation is a foundational textbook that introduces the mathematical and theoretical principles underlying computer science, including automata, formal languages, and computability.
-
B.
Computability and Unsolvability
Computability and Unsolvability is a classic 1958 textbook by Martin Davis that systematically develops the theory of computable functions and undecidable problems, helping to shape modern computability theory.
-
C.
On Computable Numbers with an Application to the Entscheidungsproblem
"On Computable Numbers, with an Application to the Entscheidungsproblem" is Alan Turing’s landmark 1936 paper that introduced the Turing machine model and founded the formal study of computability and the limits of algorithmic decision procedures.
-
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.
Introduction to the Theory of Computation
Introduction to the Theory of Computation is a widely used textbook in theoretical computer science that covers formal languages, automata, computability, and complexity theory.
- 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: Finite Automata and Their Decision Problems Target entity description: "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.
-
A.
Elements of the Theory of Computation
Elements of the Theory of Computation is a foundational textbook that introduces the mathematical and theoretical principles underlying computer science, including automata, formal languages, and computability.
-
B.
Computability and Unsolvability
Computability and Unsolvability is a classic 1958 textbook by Martin Davis that systematically develops the theory of computable functions and undecidable problems, helping to shape modern computability theory.
-
C.
On Computable Numbers with an Application to the Entscheidungsproblem
"On Computable Numbers, with an Application to the Entscheidungsproblem" is Alan Turing’s landmark 1936 paper that introduced the Turing machine model and founded the formal study of computability and the limits of algorithmic decision procedures.
-
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.
Introduction to the Theory of Computation
Introduction to the Theory of Computation is a widely used textbook in theoretical computer science that covers formal languages, automata, computability, and complexity theory.
- F. None of above. chosen
Statements (30)
| Predicate | Object |
|---|---|
| instanceOf |
landmark paper in computer science
ⓘ
scientific paper ⓘ |
| author |
Dana Scott
NERFINISHED
ⓘ
Michael Rabin NERFINISHED ⓘ |
| coAuthorWith |
Dana Scott
NERFINISHED
ⓘ
Michael Rabin NERFINISHED ⓘ |
| contribution |
formalized key decision problems for finite automata
ⓘ
founded the modern theory of finite automata ⓘ introduced systematic study of automata-theoretic decision procedures ⓘ |
| era | early theoretical computer science ⓘ |
| field |
automata theory
ⓘ
computability theory ⓘ theoretical computer science ⓘ |
| impact |
influenced the development of formal language theory
ⓘ
influenced the theory of computation ⓘ provided foundations for later work on automata and logic ⓘ |
| language | English ⓘ |
| publicationYear | 1959 ⓘ |
| recognizedAs |
classic paper in automata theory
ⓘ
seminal work in decision problems for automata ⓘ |
| title | Finite Automata and Their Decision Problems NERFINISHED ⓘ |
| topic |
decision problems
ⓘ
deterministic finite automata ⓘ emptiness problem ⓘ equivalence of automata ⓘ finite automata ⓘ membership problem ⓘ minimization of finite automata ⓘ nondeterministic finite automata ⓘ regular languages ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Finite Automata and Their Decision Problems Description of subject: "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.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject surface form:
Michael O. Rabin