This textbook presents a thorough foundation to the theory of computation. Combining intuitive descriptions and illustrations with rigorous arguments and detailed proofs for key topics, the logically structured discussion guides the reader through the core concepts of automata and languages, computability, and complexity of computation. Topics and features: presents a detailed introduction to the theory of computation, complete with concise explanations of the mathematical prerequisites; provides end-of-chapter problems with solutions, in addition to chapter-opening summaries and numerous examples and definitions throughout the text; draws upon the author's extensive teaching experience and broad research interests; discusses finite automata, context-free languages, and pushdown automata; examines the concept, universality and limitations of the Turing machine; investigates computational complexity based on Turing machines and Boolean circuits, as well as the notion of NP-completeness.

Von der hinteren Coverseite

Computation lies at the heart of modern digital technology and our increasingly advanced information society. The theory of computation describes what tasks can and cannot be computed, and how efficiently the computable tasks can be computed.

This focused and accessible guide/textbook presents a thorough foundation to the theory of computation, whilst also providing a deeper insight for those looking to pursue research in this field. Combining intuitive descriptions and illustrations with rigorous arguments and detailed proofs for key topics, the logically structured discussion guides the reader through the core concepts of automata and languages, computability, and complexity of computation. Self-contained and supported by practical examples, the text is suitable for a one- or two-semester undergraduate course in the theory of computation.

Topics and features:

Presents a detailed introduction to the theory of computation, complete with concise explanations of the mathematical prerequisites
Provides end-of-chapter problems with solutions, in addition to chapter-opening summaries and numerous examples and definitions throughout the text
Draws upon the author's extensive teaching experience and broad research interests
Discusses finite automata, context-free languages, and pushdown automata
Examines the concept, universality and limitations of the Turing machine
Investigates computational complexity based on Turing machines and Boolean circuits, as well as the notion of NP-completeness

This hands-on and easy-to-read textbook/reference is ideal for undergraduate students of computer science and related disciplines needing to develop a deep understanding of this fascinating field, even if they have no prior knowledge of the subject.

Dr. Akira Maruoka is a professor in the Faculty of Science and Engineering at Ishinomaki Senshu University, Japan.

��ber diesen Titel� kann sich auf eine andere Ausgabe dieses Titels beziehen.

Anbieterinformationen

Better World Books (https://www.BetterWorldBooks.com) is a for-profit, socially conscious business and a global online bookseller that collects and sells new and used books online, matching each purchase with a book donation. Each sale generates funds for literacy and education initiatives in the U.S., the UK, and around the world. Since its launch in 2003, Better World Books has raised $33 million for libraries and literacy, donated over 32 million books, and reused or recycled more than 397 million books.

Zur Homepage des Verk�ufers

Unternehmensdaten des Verk�ufers

Better World Books Marketplace, Inc.
55740 Currant Road, Mishawaka, IN, 46545, U.S.A.

Gesch�ftsbedingungen und Versandinformationen

Verkaufsbedingungen

Better World Books (BWB) values your satisfaction and offers you returns within thirty (30) days after the estimated delivery date on most items. All returned items must be in the original condition; used items should include the SKU sticker located on the spine or back of the product.

If you have an incomplete, incorrect, or damaged shipment, please contact our Customer Care team via Abebooks contact seller options before proceeding with the return.Please keep in mind that because we deal mostl...

Mehr Information

Widerrufsbelehrung

Versandbedingungen

Please allow 1-2 business days for order fulfillment.

Versandkosten innerhalb von USA

Versandkosten innerhalb von USA
Bestellmenge	4 bis 8�Werktage	3 bis 5�Werktage
Erster Artikel	EUR 0.00	EUR 8.52

Die Versandzeiten werden von den Verk�uferinnen und Verk�ufern festgelegt. Sie variieren je nach Versanddienstleister und Standort. Sendungen, die den Zoll passieren, k�nnen Verz�gerungen unterliegen. Eventuell anfallende Abgaben oder Geb�hren sind von der K�uferin bzw. dem K�ufer zu tragen. Die Verk�uferin bzw. der Verk�ufer kann Sie bez�glich zus�tzlicher Versandkosten kontaktieren, um einen m�glichen Anstieg der Versandkosten f�r Ihre Artikel auszugleichen.