"Introduction to Automata Theory, Languages, and Computation"

E305925

computer science book textbook theoretical computer science textbook

"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.

Try in SPARQL Jump to: Surface forms Disambiguation Statements Elicitation Referenced by

All labels observed (3)

Label	Occurrences
Introduction to Automata Theory, Languages, and Computation	5
"Introduction to Automata Theory, Languages, and Computation" canonical	1
Introduction to Automata Theory, Languages, and Computation (GTM-related volume in some catalogs)	1

How this entity was disambiguated

This entity first appeared as the object of triple T2866509 — 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: "Introduction to Automata Theory, Languages, and Computation"
Context triple: [Princeton Mathematical Series, workIncluded, "Introduction to Automata Theory, Languages, and Computation"]

A. 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.
B. Compilers: Principles, Techniques, and Tools
Compilers: Principles, Techniques, and Tools is a foundational computer science textbook that systematically covers the theory and practice of compiler design and implementation.
C. Chomsky hierarchy
The Chomsky hierarchy is a classification of formal grammars into four types that correspond to increasing levels of generative power and computational complexity in formal language theory.
D. Introduction to Algorithms
Introduction to Algorithms is a widely used, comprehensive textbook on algorithms and data structures, renowned for its rigorous yet accessible coverage of theoretical and practical topics in computer science.
E. 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.
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: "Introduction to Automata Theory, Languages, and Computation"
Target entity description: "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.

A. 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.
B. Compilers: Principles, Techniques, and Tools
Compilers: Principles, Techniques, and Tools is a foundational computer science textbook that systematically covers the theory and practice of compiler design and implementation.
C. Chomsky hierarchy
The Chomsky hierarchy is a classification of formal grammars into four types that correspond to increasing levels of generative power and computational complexity in formal language theory.
D. Introduction to Algorithms
Introduction to Algorithms is a widely used, comprehensive textbook on algorithms and data structures, renowned for its rigorous yet accessible coverage of theoretical and practical topics in computer science.
E. 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.
F. None of above. chosen

Statements (49)

Predicate	Object
instanceOf	computer science book ⓘ textbook ⓘ theoretical computer science textbook ⓘ
academicDiscipline	computer science ⓘ mathematics ⓘ
author	Jeffrey D. Ullman ⓘ John E. Hopcroft ⓘ Rajeev Motwani ⓘ
countryOfPublication	United States ⓘ linked to: United States of America
field	automata theory ⓘ computational complexity theory ⓘ formal languages ⓘ theoretical computer science ⓘ
hasEdition	first edition ⓘ second edition ⓘ third edition ⓘ
language	English ⓘ
notableFor	integration of automata, languages, and complexity theory ⓘ systematic development of automata theory ⓘ
originalAuthor	Jeffrey D. Ullman ⓘ John E. Hopcroft ⓘ
pedagogicalFeature	end-of-chapter exercises ⓘ formal proofs ⓘ worked examples ⓘ
publisher	Addison-Wesley ⓘ
topic	Chomsky hierarchy ⓘ NP-completeness ⓘ P versus NP problem ⓘ Turing machines ⓘ linked to: Turing machine closure properties of languages ⓘ computability ⓘ computational complexity ⓘ context-free grammars ⓘ decidability ⓘ deterministic finite automata ⓘ finite automata ⓘ nondeterministic finite automata ⓘ pumping lemma for context-free languages ⓘ pumping lemma for regular languages ⓘ pushdown automata ⓘ reducibility ⓘ regular expressions ⓘ regular languages ⓘ space complexity ⓘ time complexity ⓘ undecidability ⓘ
use	graduate teaching ⓘ self-study ⓘ undergraduate teaching ⓘ

How these facts were elicited

Referenced by (7)

Full triples — surface form annotated when it differs from this entity's canonical label.

Princeton Mathematical Series → workIncluded → "Introduction to Automata Theory, Languages, and Computation" ⓘ

Jeffrey D. Ullman → notableWork → Introduction to Automata Theory, Languages, and Computation ⓘ