• Title: Introduction to Theory of Computation
• Authors Anil Maheshwari and Michiel Smid
• Publisher: Carleton University ; eBook (Creative Commons Licensed)
• License(s): Creative Commons License (CC)
• Hardcover/Paperback: N/A
• eBook: PDF (252 pages)
• Language: English
• ISBN-10: N/A
• ISBN-13: N/A
• Share This:  

Book Description

This is a textbook on formal languages, automata theory, and computational complexity. This text strikes a good balance between rigor and an intuitive approach to computer theory.

Covers all the topics needed by computer scientists with a sometimes humorous approach that reviewers found "refreshing". It is easy to read and the coverage of mathematics is fairly simple so readers do not have to worry about proving theorems.

• Anil Maheshwari and Michiel Smid are Professors of Computer Science, School of Computer Science, Carleton University, Ottawa, Canada.

• Amazon

• Theory of Computation and Computing
• Computational Complexity
• Mathematical Logic - Set Theory, Model Theory, Computability, etc
• Introduction to Computer Science

• Introduction to Theory of Computation (Anil Maheshwari, et al.)
• The Mirror Site (1) - PDF

• Theory of Computation, Making Connections (Jim Hefferon)

  The book is geared toward those who thirst for computation theory knowledge. To cater to the demands of a wide range of people, the principles in this book are explained in a way that is easy to understand, digest and apply in the upcoming career.

• Models of Computation: Exploring the Power of Computing

  It covers the traditional topics of formal languages, automata and complexity classes, as well as an introduction to the more modern topics of space-time tradeoffs, memory hierarchies, parallel computation, the VLSI model, and circuit complexity.

• Automata Theory: An Algorithmic Approach (Javier Esparza, et al)

  This textbook presents Automata Theory from a fresh viewpoint inspired by its main modern application, program verification, where automata are viewed as data structures for the algorithmic manipulation of sets and relations.

• A Data-Centric Introduction to Computing (Kathi Fisler, et al)

  This book is an introduction to computer science. It will teach you to program, and do so in ways that are of practical value and importance. It uses a data-centric approach: data centric = data science + data structures.

• Introduction to Classical and Quantum Computing (Tom Wong)

  This book is for students who want to learn quantum computing beyond a conceptual level, but who lack advanced training in mathematics. The only prerequisite is trigonometry, and mathematics beyond that will be covered.

• Introduction to Computing: Language, Logic, and Machines

  This book focuses on how to describe information processes by defining procedures, how to analyze the costs required to carry out a procedure, and the fundamental limits of what can and cannot be computed mechanically.

• Soft Computing: Techniques in Engineering Sciences

  Soft Computing is used where a complex problem is not adequately specified for the use of conventional math and computer techniques. This book elaborates on the most recent applications of Soft Computing in various fields of engineering.

• Quantum Computing: Progress and Prospects

  Provides an introduction to the Quantum Computing, including the unique characteristics and constraints of the technology, and assesses the feasibility and implications of creating a functional quantum computer capable of addressing real-world problems.

• Foundations of Computation (Carol Critchlow, et al)

  It includes topics from discrete mathematics, automata theory, formal language theory, and the theory of computation, along with practical applications to computer science. The course has no prerequisites other than introductory computer programming.