Title
Automata, Computability and Complexity: Theory and Applications,New
Delivery time: 8-12 business days (International)
The theoretical underpinnings of computing form a standard part of almost every computer science curriculum. But the classic treatment of this material isolates it from the myriad ways in which the theory influences the design of modern hardware and software systems. The goal of this book is to change that. The book is organized into a core set of chapters (that cover the standard material suggested by the title), followed by a set of appendix chapters that highlight application areas including programming language design, compilers, software verification, networks, security, natural language processing, artificial intelligence, game playing, and computational biology.The core material includes discussions of finite state machines, Markov models, hidden Markov models (HMMs), regular expressions, contextfree grammars, pushdown automata, Chomsky and Greibach normal forms, contextfree parsing, pumping theorems for regular and contextfree languages, closure theorems and decision procedures for regular and contextfree languages, Turing machines, nondeterminism, decidability and undecidability, the ChurchTuring thesis, reduction proofs, Post Correspondence problem, tiling problems, the undecidability of firstorder logic, asymptotic dominance, time and space complexity, the CookLevin theorem, NPcompleteness, Savitch's Theorem, time and space hierarchy theorems, randomized algorithms and heuristic search. Throughout the discussion of these topics there are pointers into the application chapters. So, for example, the chapter that describes reduction proofs of undecidability has a link to the security chapter, which shows a reduction proof of the undecidability of the safety of a simple protection framework.
By changing our most important processes and
products, we have already made a big leap forward. This ranges from the
increased use of more sustainable fibers to the use of more
environmentally friendly printing processes to the development of
efficient waste management in our value chain.
⚠️ WARNING (California Proposition 65):
This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.
For more information, please visit www.P65Warnings.ca.gov.
Shipping & Returns
Shipping
We ship your order within 2–3 business days for USA deliveries and 5–8 business days for international shipments. Once your package has been dispatched from our warehouse, you'll receive an email confirmation with a tracking number, allowing you to track the status of your delivery.
Returns
To facilitate a smooth return process, a Return Authorization (RA) Number is required for all returns. Returns without a valid RA number will be declined and may incur additional fees. You can request an RA number within 15 days of the original delivery date. For more details, please refer to our Return & Refund Policy page.
Shipping & Returns
Shipping
We ship your order within 2–3 business days for USA deliveries and 5–8 business days for international shipments. Once your package has been dispatched from our warehouse, you'll receive an email confirmation with a tracking number, allowing you to track the status of your delivery.
Returns
To facilitate a smooth return process, a Return Authorization (RA) Number is required for all returns. Returns without a valid RA number will be declined and may incur additional fees. You can request an RA number within 15 days of the original delivery date. For more details, please refer to our Return & Refund Policy page.
Warranty
We provide a 2-year limited warranty, from the date of purchase for all our products.
If you believe you have received a defective product, or are experiencing any problems with your product, please contact us.
This warranty strictly does not cover damages that arose from negligence, misuse, wear and tear, or not in accordance with product instructions (dropping the product, etc.).
Warranty
We provide a 2-year limited warranty, from the date of purchase for all our products.
If you believe you have received a defective product, or are experiencing any problems with your product, please contact us.
This warranty strictly does not cover damages that arose from negligence, misuse, wear and tear, or not in accordance with product instructions (dropping the product, etc.).
Secure Payment
Your payment information is processed securely. We do not store credit card details nor have access to your credit card information.
We accept payments with :
Visa, MasterCard, American Express, Paypal, Shopify Payments, Shop Pay and more.
Secure Payment
Your payment information is processed securely. We do not store credit card details nor have access to your credit card information.
We accept payments with :
Visa, MasterCard, American Express, Paypal, Shopify Payments, Shop Pay and more.
Related Products
You may also like
Frequently Asked Questions
- Q: What topics are covered in 'Automata, Computability and Complexity'? A: The book covers foundational topics in computing, including finite state machines, Markov models, Turing machines, decidability, NP-completeness, and various application areas like programming language design and artificial intelligence.
- Q: Who is the author of this book? A: The book is authored by Elaine A. Rich.
- Q: What is the publication date of 'Automata, Computability and Complexity'? A: This book was published on September 28, 2007.
- Q: Is this book suitable for beginners in computer science? A: While it covers essential topics, the book is best suited for readers with some foundational knowledge in computer science due to its theoretical depth.
- Q: How many pages does this book contain? A: The book contains 1120 pages.
- Q: What is the binding type of this book? A: The book is available in hardcover binding.
- Q: What condition is this book in? A: This book is listed in acceptable condition.
- Q: Are there any application examples in the book? A: Yes, the book includes appendix chapters that link theoretical concepts to practical applications in fields such as software verification and computational biology.
- Q: Does this book include exercises or problems? A: The book does not specify exercises, but it provides thorough discussions and examples related to the theory.
- Q: Is this book suitable for advanced studies in computer science? A: Yes, it is appropriate for advanced studies, particularly for those focusing on theoretical computer science and its applications.