Posted by **groovebeat** at Sept. 12, 2014

WEB-Rip | .RM | RealMedia Video | 320x240 | RealMedia Audio | 25 Hours | 3.37 GB

A theoretical treatment of what can be computed and how fast it can be done. Applications to compilers, string searching, and control circuit design will be discussed. The hierarchy of finite state machines, pushdown machines, context free grammars and Turing machines will be analyzed, along with their variations. The notions of decidability, complexity theory and a complete discussion of NP-Complete problems round out the course.

Posted by **ChrisRedfield** at June 14, 2014

Published: 2009-11-20 | ISBN: 1584888229 | PDF | 988 pages | 9 MB

Posted by **fdts** at Jan. 5, 2014

by John Martin

English | 2010 | ISBN: 0073191469 | 448 pages | PDF | 3.42 MB

Posted by **libr** at Oct. 6, 2013

English | 2006-03-23 | ISBN: 1846282977 | 440 pages | PDF | 3.6 mb

This textbook is uniquely written with dual purpose. It cover cores material in the foundations of computing for graduate students in computer science and also provides an introduction to some more advanced topics for those intending further study in the area.

Posted by **interes** at Aug. 18, 2013

English | November 20, 2009 | ISBN-10: 1584888202 | 950 pages | PDF | 6,8 Mb

Algorithms and Theory of Computation Handbook, Second Edition: Special Topics and Techniques provides an up-to-date compendium of fundamental computer science topics and techniques. It also illustrates how the topics and techniques come together to deliver efficient solutions to important practical problems.

Posted by **interes** at Sept. 11, 2012

English | 2010 | ISBN: 0073191469 | 448 pages | PDF | 3,3 MB

Introduction to Languages and the Theory of Computation helps students make the connection between the practice of computing and an understanding of the profound ideas that defines it. The book's organization and the author's ability to explain complex topics clearly make this introduction to the theory of computation an excellent resource for a broad range of upper level students.

Posted by **lenami** at Jan. 17, 2012

Publisher: Course Technology | ISBN: 0534950973 | edition 2005 | PDF | 453 pages | 34Б7 mb

“Intended as an upper-level undergraduate or introductory graduate text in computer science theory," this book lucidly covers the key concepts and theorems of the theory of computation. The presentation is remarkably clear; for example, the "proof idea," which offers the reader an intuitive feel for how the proof was constructed, accompanies many of the theorems and a proof. Introduction to the Theory of Computation covers the usual topics for this type of text plus it features a solid section on complexity theory – including an entire chapter on space complexity.

Posted by **anonx** at Oct. 31, 2006

February 15, 2005 | ISBN: 0534950973 | DjVu | 456 Pages | 6,57 MB

“Intended as an upper-level undergraduate or introductory graduate text in computer science theory," this book lucidly covers the key concepts and theorems of the theory of computation. The presentation is remarkably clear; for example, the "proof idea," which offers the reader an intuitive feel for how the proof was constructed, accompanies many of the theorems and a proof. Introduction to the Theory of Computation covers the usual topics for this type of text plus it features a solid section on complexity theory – including an entire chapter on space complexity. The final chapter introduces more advanced topics, such as the discussion of complexity classes associated with probabilistic algorithms.”

Posted by **interes** at Nov. 21, 2015

English | ISBN: 113318779X | 2012 | PDF | 480 pages | 10.2 MB

Posted by **tukotikko** at Feb. 23, 2015

1997 | 464 Pages | ISBN: 0201258285 | PDF | 24 MB