Introduction to the Theory of Computation
Cengage Learning, 27 jun. 2012 - 504 pagina's
Now you can clearly present even the most complex computational theory topics to your students with Sipser's distinct, market-leading INTRODUCTION TO THE THEORY OF COMPUTATION, 3E. The number one choice for today's computational theory course, this highly anticipated revision retains the unmatched clarity and thorough coverage that make it a leading text for upper-level undergraduate and introductory graduate students. This edition continues author Michael Sipser's well-known, approachable style with timely revisions, additional exercises, and more memorable examples in key areas. A new first-of-its-kind theoretical treatment of deterministic context-free languages is ideal for a better understanding of parsing and LR(k) grammars. This edition's refined presentation ensures a trusted accuracy and clarity that make the challenging study of computational theory accessible and intuitive to students while maintaining the subject's rigor and formalism. Readers gain a solid understanding of the fundamental mathematical properties of computer hardware, software, and applications with a blend of practical and philosophical coverage and mathematical treatments, including advanced theorems and proofs. INTRODUCTION TO THE THEORY OF COMPUTATION, 3E's comprehensive coverage makes this an ideal ongoing reference tool for those studying theoretical computing.
Important Notice: Media content referenced within the product description or the product text may not be available in the ebook version.
Wat mensen zeggen - Een review schrijven
We hebben geen reviews gevonden op de gebruikelijke plaatsen.
Overige edities - Alles weergeven
2012 Cengage Learning accept affect the overall alphabet arrows automata binary Cengage Learning reserves circuit clause complexity computation history configuration construct contains context-free grammar context-free languages copied Copyright 2012 Cengage corresponding DCFG decidable define definition describe deterministic directed graph DPDA Due to electronic duplicated eBook and/or eChapter(s edges Editorial review electronic rights equivalent example exponential finite automaton following figure GNFA Hence input string input symbol log space materially affect nodes nondeterministic NP-complete output overall learning experience path Player polynomial polynomial time algorithm problem PROOF IDEA prove PSPACE pumping lemma pushdown reading recognizes regular expression regular languages reject remove additional reserves the right review has deemed right to remove Rights Reserved rule runs scanned sequence simulation step suppressed content tape third party content transition function Turing machine Turing-recognizable undecidable variable Verifier whole