Algorithms, Languages, Automata and Compilers-A Practical Approach by Maxim Mozgovoy

Since before computers existed scientists have considered important questions regarding algorithms, how to efficiently solve problems, and how ot create a machine that solves these seemingly challenging situations. Algorithms, Languages, Automata, and Compilers: A Practical Approach is devoted to the theoretical foundations of Computer Science with an emphasis on practical examples. Accessible and user-friendly, this book is designed to cover the standard theory of computing topics while highlighting algorithmic examples rather than formulas and theorems. Finite automata, Turing machines, models of computation, complexity, solvability, and other topics that form a foundation of a modern programming are discussed, first with a gentle theoretical orientation, and then are applied through programming code and practical examples. JFLAP projects and applications are integrated throughout the book, and program examples are given in languages such as C# and JavaTM.

KEY FEATURES:

• Covers the standard theory of computing topics through a strong emphasis on practical applications rather than theorems and proofs
• Integrates JFLAP projects and exercises throughout
• Contains a comprehensive chapter on Turing machines, including a section of Turing machine emulation with the JFLAP system
• Includes a resource CD-ROM with code from the text