Introduction to the Theory of Computation
E32458
Introduction to the Theory of Computation is a widely used textbook in theoretical computer science that covers formal languages, automata, computability, and complexity theory.
Aliases (2)
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
computer science book
→
textbook → |
| author |
Michael Sipser
→
|
| country |
United States
→
|
| emphasizes |
mathematical rigor
→
proof techniques → |
| field |
theoretical computer science
→
|
| format |
digital
→
print → |
| genre |
academic textbook
→
|
| hasEdition |
first edition
→
second edition → third edition → |
| hasExercise |
algorithmic problems
→
proof-based problems → |
| hasSection |
Automata and Languages
→
Complexity Theory → Computability Theory → |
| intendedAudience |
computer science students
→
instructors in theoretical computer science → |
| language |
English
→
|
| notableFor |
clear exposition of automata and complexity
→
|
| publisher |
Cengage Learning
→
Thomson Course Technology → |
| relatedTo |
Computational Complexity (book)
→
Introduction to Automata Theory, Languages, and Computation → |
| subject |
computer science
→
mathematics → |
| topic |
NP-completeness
→
Turing machines → automata theory → complexity theory → computability theory → computational models → context-free languages → decidability → finite automata → formal languages → pushdown automata → reduction → regular languages → space complexity → time complexity → |
| usedAs |
university textbook
→
|
| usedFor |
preparation for advanced theory courses
→
|
| usedIn |
graduate courses
→
undergraduate courses → |
Referenced by (5)
| Subject (surface form when different) | Predicate |
|---|---|
|
Addison-Wesley
→
|
hasPublished |
|
Michael Sipser
→
|
hasWritten |
|
Michael Sipser
("textbook Introduction to the Theory of Computation")
→
|
knownFor |
|
Michael Sipser
→
|
notableWork |
|
Introduction to the Theory of Computation
("Introduction to Automata Theory, Languages, and Computation")
→
|
relatedTo |