β Scribed by John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman
No coin nor oath required. For personal study only.
This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity. The authors present the theory in a concise and straightforward manner, with an eye out for the practical applications. Exercises at the end of each chapter, including some that have been solved, help readers confirm and enhance their understanding of the material. This book is appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
π SIMILAR VOLUMES
Introduction to Discrete Event Systems is a comprehensive introduction to the field of discrete event systems, offering a breadth of coverage that makes the material accessible to readers of varied backgrounds. The book emphasizes a unified modeling framework that transcends specific application are
The theory of formal languages and the theory of automata were both initiated in the late 1950s, explains Ito (Kyoto Sangyo U., Japan), and the two fields have since developed into important theoretical foundations of computer science. He looks at the two from the algebraic perspective, beginning wi