Concise Guide to Computation Theory, 2011
Auteur : Maruoka Akira
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.
Date de parution : 08-2014
Ouvrage de 281 p.
15.5x23.5 cm
Date de parution : 05-2011
Ouvrage de 281 p.
15.5x23.5 cm