Automata and Computability (textbook)
E825608
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.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Automata and Computability (textbook) canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T9838468 — 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 and Computability (textbook) Context triple: [Dexter Kozen, notableWork, Automata and Computability (textbook)]
-
A.
"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.
-
B.
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.
-
C.
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.
-
D.
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.
-
E.
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.
- 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 and Computability (textbook) Target entity description: 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.
-
A.
"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.
-
B.
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.
-
C.
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.
-
D.
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.
-
E.
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.
- F. None of above. chosen
Statements (41)
| Predicate | Object |
|---|---|
| instanceOf |
textbook
ⓘ
theoretical computer science book ⓘ |
| author | Dexter Kozen NERFINISHED ⓘ |
| countryOfPublication |
United States of America
ⓘ
surface form:
United States
|
| educationalLevel |
introductory graduate
ⓘ
upper-level undergraduate ⓘ |
| emphasizes |
mathematical rigor
ⓘ
proof techniques in computer science ⓘ |
| field |
automata theory
ⓘ
computability theory ⓘ formal languages ⓘ theoretical computer science ⓘ |
| focus |
formal language theory
ⓘ
formal models of computation ⓘ foundations of computability ⓘ |
| hasAuthor | Dexter Kozen NERFINISHED ⓘ |
| hasPart |
definitions and theorems
ⓘ
exercises ⓘ worked examples ⓘ |
| intendedAudience |
graduate students
ⓘ
undergraduate students ⓘ |
| language | English ⓘ |
| publisher | Springer NERFINISHED ⓘ |
| relatedTo |
Elements of the Theory of Computation
NERFINISHED
ⓘ
Introduction to Automata Theory, Languages, and Computation NERFINISHED ⓘ |
| series | Undergraduate Texts in Computer Science NERFINISHED ⓘ |
| subjectCategory |
computer science textbook
ⓘ
mathematics of computing ⓘ |
| teaches |
closure properties of language classes
ⓘ
decision procedures for language classes ⓘ formal proofs about automata ⓘ reductions in computability theory ⓘ |
| topic |
Turing machines
NERFINISHED
ⓘ
computational complexity (introductory) ⓘ context-free grammars ⓘ decidability ⓘ finite automata ⓘ pushdown automata ⓘ regular languages ⓘ undecidability ⓘ |
| usedAs | university course textbook ⓘ |
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: Automata and Computability (textbook) Description of subject: 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.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.