Synopsis
Part I: The Theory of Computation
Everything Begins With Computation
Preliminaries to the Theory of Computation
Part II: Automata and Languages
Finite Automata
Context-Free Languages
Pushdown Automaton
Part III: Computability
Turing Machine
Universality of Turing Machine and its Limitation
Part IV: Complexity of Computation
Computational Complexity Based on Turing Machines
Computational Complexity Based on Boolean Circuits
NP-Completeness
Solutions
Concluding Remarks
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
