Algorithms, Languages, Automata, & Compilers

Algorithms, Languages, Automata, & Compilers: A Practical Approach
by Maxim Mozgovoy
Covers the standard "theory of computing" topics through a strong emphasis on practical applications rather than theorems and proofs.
Integrates JFLAP projects/exercises.
Comprehensive chapters on Turing Machines (Ch10 / 11) including a section on Turing machine emulation with JFLAP system.
Includes a CD-ROM with code, applications, simulations figures.
Algorithms, Languages, Automata, & Compilers: A Practical Approach is designed to cover the standard “theory of computing” topics through a strong emphasis on practical applications rather than theorems and proofs. Finite automata, Turing machines, models of computation, complexity, solvability, and other topics that form a foundation of modern programming are discussed -first with a gentle theoretical orientation, and then applied through programming code and practical examples. JFLAP projects and applications are integrated throughout the book, and C# is used for all code.
Publisher: Jones and Bartlett
Page Count: 345
ISBN10: 0763776270
ISBN13: 9780763776275
Cover: Hardcover
Media: CD-ROM
Pub Date: 08/19/2009