Amazon cover image
Image from Amazon.com

Algorithms, languages, automata, and compilers : a practical approach / Maxim Mozgovoy.

By: Material type: TextTextPublication details: Sudbury, Massachusetts : Jone and Bartlett Learning, c2010Description: xii, 345 pages : illustrations ; 24 cmISBN:
  • 9780763776275
Subject(s): LOC classification:
  • QA 267 .M69 2010
Contents:
Ch. 1. Regular Languages and Regular Expressions -- Ch. 2. Finite Automata -- Ch. 3. The Relationship Between Finite Automata and Regular Expressions -- Ch. 4. Finite-State Machines in Practice -- Ch. 5. Nonregular Languages and Content-Free Grammars -- Ch. 6. Pushdown Automata -- Ch. 7. Parsing -- Ch. 8. Compiler Generation -- Ch. 9. The Lindenmayer Systems (L-Systems) -- Ch. 10. Turing Machines -- Ch. 11. Decidability and Complexity.
Summary: 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.
Item type: Books
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Home library Collection Call number Copy number Status Date due Barcode
Books Books National University - Manila LRC - Main General Circulation Machine Learning GC QA 267 .M69 2010 (Browse shelf(Opens below)) c.1 Available NULIB000009759

Includes bibliographical references and index.

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

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.

There are no comments on this title.

to post a comment.