Here is the listing of Best reference books on Formal Systems.
|1. “Introduction to the Theory of Computation” by Michael Sipser|
|2. “Introduction to Computability” by Fred C. Hennie
Book Review: The book covers the topic of algorithmic computation which is an abstract treatment of algorithm classes and properties. Further the book covers topics on Turing machines and computability, primitive recursive functions where details about PR functions are nicely demonstrated. The further chapters define recursive and recursively enumerable sets and show the relationship between them and the functions described in other chapters. The other chapters in the book focus on the issues of computability and decidability. The authored revisits the same concepts in different contexts. The book is useful for readers who need slow exposition to concepts and contains very interesting and useful exercises.
|3. “The Theory of Computation” by Bernard M. Moret
Book Review: This book focuses on the concept of problem solving through the method of computation in the presence of realistic resource constraints. The book gives a set of questions and methods that characterize computer science theoretically thereby dealing with all the practical issues in the field of computing. The book also presents limits to computation thereby relating the limits to resource usage and exploring the avenues of compromise through approximation and randomization. The book also deals with research areas in theoretical computer sciences that have a great impact in the area of computing.
|4. “Automata and Computability” by Dexter C. Kozen
Book Review: This book is very useful for undergraduate students which provides introduction to various theoretical methods of computability thereby providing rich and varied structural models. The book describes finite automata and its properties. The book also provides a broader class of models and provides the analysis of context free languages. In the later part, the book provides description of turing machines and the book provides analysis of effective computability, decidability and other incompleteness theorems. The book also covers concepts of elementary discrete mathematics and the book also contains chapters that cover more advanced concepts.
|5. “Introduction to Languages and The Theory of Computation” by John Martin
Book Review: This book establishes connection between computing practice and an understanding of the profound ideas that defines it. The book also has the ability to explain complex topics clearly thereby making an introduction to the theory of computation an amazing resource for a number of upper level students. The book presents theoretical concepts with the help of the precision and clarity of mathematical language. The author also presents the necessary mathematical tools and also provides discussion and examples that make the language intelligible.
Sanfoundry Global Education & Learning Series – Best Reference Books!