Fundamentals of the Theory of Computation: Principles and Practice: Principles and Practice
Author | : | |
Rating | : | 4.75 (660 Votes) |
Asin | : | B0095GFSUW |
Format Type | : | |
Number of Pages | : | 394 Pages |
Publish Date | : | 2013-03-17 |
Language | : | English |
DESCRIPTION:
This is a great book to take a course from I took a course from Hoover, one of the authors, using this book. The material is very suitable for a senior undergraduate course introducing the theory of computing. It covers all the essential notions one needs to proceed further into the field, such as all the various types of automata, circuits, complexity-related notations, etc. And, most importantly, I think it does so in a readable, dare I say enjoyable fashion. It gets formal when it needs to be, but intuitive when appr
Directed at undergraduates who may have difficulty understanding the relevance of the course to their future careers, the text helps make them more comfortable with the techniques required for the deeper study of computer science. This innovative textbook presents the key foundational concepts for a one-semester undergraduate course in the theory of computation. The text motivates students by clarifying complex theory with many examples, exercises and detailed proofs.* This book is shorter and more accessible than the books now being used in core computer theory courses. It offers the most accessible and motivational course material available for undergraduate computer theory classes. * Theory of computing is a standard, required course in all computer science departments.
He received a Bachelor of Arts in Mathematics from Pomona College in 1983, a Master of Science in Computer Science from the University of Washington in 1986, and a Ph.D. Greenlaw served as the Regional Coordinator for the State of Georgia's $100,000,000 Yamacraw Project, which was designed to make the state
From the Back CoverThis innovative textbook presents the key foundational concepts that can be covered in a one semester undergraduate course in the theory of computation. It offers the most accessible and motivational course material available for undergraduate computer theory classes and is directed at the typical undergraduate who may have difficulty understanding the relevance of the course to their future careers. intractable problemsMotivates students by clarifying complex theory with many examples, exercises, and detailed proofsOffers an integrated review of discrete math concepts, defining each concept where it is first usedUnifies notation for descr