Page Tools:

Algorithms, Languages, Automata, & Compilers: A Practical Approach

Author(s): Maxim Mozgovoy, University of Joensuu (Finland)
Details:
  • ISBN-13: 9780763776275
  • Hardcover    345 pages      © 2010
Price: International Sales $160.95 US List
Add to Cart Request a Review Copy

Overview

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.

Scroll down to the Samples tab to view the press release

ShowKey Features

  • 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.

Back to top

ShowTable of Contents

1  Regular Languages and Regular Expressions
2  Finite Automata
3  The Relationship Between Finite Automata and Regular Expressions
4  Finite-State Machines in Practice
5  Nonregular Languages and Context-Free Grammars
6  Pushdown Automata
7  Parsing
8  Compiler Generation
9  The Lindenmayer Systems (L-Systems)
10  Turing Machines
11  Decidability and Complexity
Back to top

ShowAbout the Author(s)

Maxim Mozgovoy-University of Joensuu (Finland)

Back to top

ShowAppropriate Courses

Ideal for courses in Theory of Computing, Formal Languages, Algorithms & Automata, and Compilers.

Back to top

ShowSamples & Additional Resources

Back to top