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.

Chapter 1 Regular Languages and Regular Expressions
Chapter 2 Finite Automate
Chapter 3 The Relationship Between Finite Automate and Regular Expressions
Chapter 4 Finite-State Machines in Practice
Chapter 5 Nonregular Languages and Context-Free Grammars
Chapter 6 Pushdown Automata
Chapter 7 Parsing
Chapter 8 Compiler Generation
Chapter 9 The Lindenmayer Systems (L-Systems)
Chapter 10 Turing Machines
etc.