Introduction to Theory of Computation (Anil Maheshwari, et al)

 
0.0 (0)
Introduction to Theory of Computation (Anil Maheshwari, et al)

This textbook covers computational complexity, automata theory, and formal languages. This book successfully juggles an analytical approach to computer theory with an intuitive one.

covers all the subjects computer scientists need to know in a way that critics called "refreshing" and occasionally amusing. Readers do not have to worry about proving theorems because it is simple to read and covers only a small amount of mathematics.

Ebook Details

About the Authors
Computer science professors Michiel Smid and Anil Maheshwari work at Carleton University in Ottawa, Canada.
Published
Published Date / Year
(April 17, 2019, Update Continuously)
License(s)
Creative Commons Attribution-ShareAlike 4.0 International License
eBook Format
PDF (252 pages)

Similar Programming & Computer Books

Apprendre l'informatique sans ordinateur - Learn computer science without a computer
In this free programming book, the author describes how to Learn computer science without a computer.  
Dictionary of Programming Languages (Neal Ziring)
The Dictionary of Programming Languages is an online reference guide to computer coding techniques put together to educate and enhance your understanding of computer science history. Over 120 words...
The Complexity of Boolean Functions (Ingo Wegener)
One of the most fascinating and crucial areas of theoretical computer science presently includes research on the difficulty of Boolean functions in non-uniform processing models. It directly relates to...
Logic and the Foundations of Game and Decision Theory (Giacomo Bonanno, et al)
The Foundations of Game Theory and Decision Making Logic The present collection provides a vibrant and comprehensive overview of a fascinating and quickly developing field, and theory is a...
Mathematical Background: Foundations of Infinitesimal Calculus (K. Stroyan)
This mathematical "background" book demonstrates how to complete the mathematical intricacies of the main course topics. These proofs are technically infallible and entirely rigorous in the sense of contemporary...
Fuzzy Logic - Emerging Technologies and Applications (Elmer P. Dadios)
This free programming book introduces fuzzy logic's potential for use in the creation of cutting-edge technologies.  
Logic Programming in Scheme (Nils M. Holm)
These queries are addressed in this tiny book: Logic programming: What is it? Why is logic programming difficult with negation? Who or what cuts? How should I approach logic...
Model Theory, Algebra, and Geometry (Deirdre Haskell, et al)
Model theory is a subfield of mathematical logic that has found use in a variety of algebraic and geometric contexts.  
Essential Algorithms (Krzysztof Kowalczyk)
This book was created to give programmers who are just learning algorithms as well as those delving into more difficult issues a clear and succinct explanation of the topics...
Gnu COBOL Programmer's Guide (Gary L. Cutler)
The current version of GNU COBOL, formerly known as Open-COBOL, implements the syntax, semantics, and usage of the COBOL programming language, which is covered in this page. ...

Others Programming Books by Anil Maheshwari, Michiel Smid

Discrete Structures for Computer Science: Counting, Recursion, and Probability (Michiel Smid)
A thorough introduction to some of the most exciting and stunning regions of discrete mathematical structures is provided in this book.

Others Programming Books by Carleton University

Discrete Structures for Computer Science: Counting, Recursion, and Probability (Michiel Smid)
A thorough introduction to some of the most exciting and stunning regions of discrete mathematical structures is provided in this book.

User reviews

There are no user reviews for this listing.
Ratings
Rate this Book
Comments