Gå direkte til innholdet

Puslespill -20% »

Til startsiden
Logg inn
Søk etter din neste leseopplevelse
An Introduction to Theory of Computation

An Introduction to Theory of Computation

innbundet, Engelsk, 2025
862,-
Sendes innen 6-10 virkedager

This textbook aims to provide a comprehensive introduction to the theory of computation for upper-level undergraduate students and first-year graduate students in computer science and related disciplines. It covers a wide range of foundational topics essential for understanding the principles and applications of computation.

The book begins with regular languages, exploring finite automata, nondeterministic finite automata, regular expressions, and the equivalence among these apparatuses. It explores state minimization and the Myhill-Nerode Theorem, offering techniques such as pumping lemmas to identify non-regular languages and using the Myhill-Nerode Theorem for non-regularity proofs. Additionally, the closure properties of regular languages are examined.

Context-free languages are another focal point, where the text discusses context-free grammars, Chomsky normal form grammars, pushdown automata, and their equivalences. The book includes pumping lemmas and closure properties using CNF grammars and PDA analysis, as well as identifying non-context-free languages and understanding leftmost derivations.

Turing machine models are thoroughly covered, with various models and simulations explained. The book outlines configurations, the Church-Turing Thesis, and differentiates between recursive and recursively enumerable languages.

Decidability and undecidability are critical topics in the text, addressing decidable problems, diagonalization, the halting problem, and Rice’s Theorem. It also provides a characterization of decidability, discusses the Post Correspondence Problem, and examines the lower levels of the arithmetical hierarchy.

The textbook also delves into computational complexity classes, defining time and space complexity classes, and presenting efficient simulations and hierarchy theorems, including the Hennie-Stearns Theorem. It includes examples of problems in P and NP, providing a clear understanding of these classifications.

NP-completeness is explored in detail, covering SAT and 3SAT, canonical complete problems, and various NP-complete problems. The book extends to space complexity classes, discussing PSPACE complete problems, NL-complete problems, and proving that NL=coNL.

Finally, the text ventures beyond NP-completeness, discussing Ladner’s construction of non-NPC sets, randomized complexity classes, and concepts such as BPP and the polynomial hierarchy. It also examines polynomial size circuits, providing a comprehensive view of the landscape of computational complexity.

Muut ovat katselleet myös

Pidät ehkä myös näistä

Suositellut kirjauutuudet sinulle

Mer om Adlibris

Om Adlibris

Vi er Nordens største nettbokhandel, og tilbyr over 13 millioner boktitler og det meste av det beste innen spill, leker, hobby og garn. Vår misjon er å være en moderne bokhandel for alle bokelskere: et innbydende sted for lesing, læring og skaping. Det er hva som driver oss, hver dag. Adlibris er en del av Bonnier Group.

  • Alltid gode priser

  • Fri frakt over 299,-

  • Nordens største bokhandel

Meld deg på nyhetsbrev

Motta våre beste boktips, nyheter og gode tilbud. Registrer deg nå, og få 10% rabatt på det første kjøpet ditt. Tilbudet gjelder kun nye abonnenter og privatkunder. Rabatten gjelder ikke norske bøker utgitt 2024, fag- og studielitteratur, digitale bøker og gavekort.