Buy An Introduction to Theory of Computation by Mitsunori Ogihara
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Computing and Information Technology > Computer science > Mathematical theory of computation > An Introduction to Theory of Computation: An Algorithmic Approach
37%
An Introduction to Theory of Computation: An Algorithmic Approach

An Introduction to Theory of Computation: An Algorithmic Approach


     0     
5
4
3
2
1



Available


X
About the Book

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.

Table of Contents:
Part I Preparation.- Chapter 0 Mathematics and Computer Science Basics.- Part II Formal Language Theory and Automata.- Chapter 1 The Regular Languages.- Chapter 2 Non-Regularity.- Chapter 3 The Context-Free Languages.- Chapter 4 The Pushdown Automaton Model.- Part III Undecidability and Turing Machines.- Chapter 5 The Turing Machines.- Chapter 6 Decidable Languages.- Chapter 7 Undecidable Languages.- Part IV Computational Complexity and Resource-Bounded Turing Machine Computation.- Chapter 8 The Time Complexity.- Chapter 9 The Space Complexity.- Chapter 10 The Theory of NP-Completeness.- Chapter 11 Beyond NP-Completeness.- Part V Advanced Topics in Computational Complexity Theory.- Chapter 12 The Probabilistic Polynomial-Time Classes.- Chapter 13 Circuit Complexity and Unambiguity.

About the Author :
Dr. Mitsunori Ogihara joined the University of Miami in 2007 as a Professor in the Department of Computer Science and as the Director of Big Data Analytics & Data Mining in the Center for Computational Science. He serves as the Director of Education and Workforce Development in the Frost Institute for Data Science (he is currently the Director of Master of Science in Data Science and Site co-Director for NSF IUCRC CARTA). Dr. Ogihara obtained his PhD in Information Sciences from the Tokyo Institute of Technology in 1993. From 1994 to 2007, Dr. Ogihara was a Computer Science faculty member at the University of Rochester, where he was promoted to Associate Professor with tenure in 1998, and to Full Professor in 2002. He also served as Chair of the Department from 1999 to 2007. His research interests include data mining, information retrieval, network traffic data analysis, program behavior analysis, molecular computation, and music information retrieval. A prolific scholar, Dr. Ogihara has authored/co-authored four books The Complexity Theory Companion, Music Data Mining, Exploring Data Science with R and the Tidyverse, and for Springer, Fundamentals of Java Programming, and is the author of more than 200 peer-reviewed research papers. Many papers by Dr. Ogihara are through interdisciplinary collaborations. His articles appear in journals and conferences that cover many fields, including psychology, implementation science, library science, chemistry, biology, and digital humanities. He serves as Editor-in-Chief for the Theory of Computing Systems Journal (Springer) and on the editorial board for the International Journal of Foundations of Computer Science (World Scientific).    


Best Sellers


Product Details
  • ISBN-13: 9783031847394
  • Publisher: Springer International Publishing AG
  • Publisher Imprint: Springer International Publishing AG
  • Height: 235 mm
  • No of Pages: 382
  • Sub Title: An Algorithmic Approach
  • ISBN-10: 3031847393
  • Publisher Date: 08 Apr 2025
  • Binding: Hardback
  • Language: English
  • Returnable: Y
  • Width: 155 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
An Introduction to Theory of Computation: An Algorithmic Approach
Springer International Publishing AG -
An Introduction to Theory of Computation: An Algorithmic Approach
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

An Introduction to Theory of Computation: An Algorithmic Approach

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!