Concise Guide to Computation Theory 2011th Edition by Akira Maruoka (PDF)

0

 

Ebook Info

  • Published: 2011
  • Number of pages: 299 pages
  • Format: PDF
  • File Size: 4.13 MB
  • Authors: Akira Maruoka

Description

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.

User’s Reviews

Download

Keywords

Free Download Concise Guide to Computation Theory 2011th Edition in PDF format
Concise Guide to Computation Theory 2011th Edition PDF Free Download
Download Concise Guide to Computation Theory 2011th Edition 2011 PDF Free
Concise Guide to Computation Theory 2011th Edition 2011 PDF Free Download
Download Concise Guide to Computation Theory 2011th Edition PDF
Free Download Ebook Concise Guide to Computation Theory 2011th Edition

Previous articleAutomata and Languages: Theory and Applications 2000th Edition by Alexander Meduna (PDF)
Next articleMathematical Foundations of Computer Science 1984: 11th Symposium Praha, Czechoslovakia September 3-7, 1984. Proceedings (Lecture Notes in Computer Science, 176) 1984th Edition by M.P. Chytil (PDF)