Search the Catalog
 
Jones and Bartlett Home > Computer Science > Algorithms, Languages, Automata, & Compilers: A Practical Approach > Table of Contents
Overview
Appropriate Courses
Key Features
Table of Contents
About the Author(s)
Algorithms, Languages, Automata, & Compilers: A Practical Approach
Maxim Mozgovoy, University of Joensuu (Finland)

ISBN: 9780763776275
$62.95 (Sugg. US List)
Hardcover
345 Pages
© 2010

Request a Print Exam Copy

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

 Find Your Sales Rep
 Recommend This Title
 Technical Support
 International Sales

Computer Science
 Algorithms / Advanced Data Structures (CS7)
 Automata / Theory of Computation
 Infinity Science Press

About Jones and Bartlett | Computer Science Home | Tell a Friend | Contact Us | Find Your Sales Rep | Request Review Copies | Sign up for eUpdates | Become an Author | Technical Support | Privacy Policy