Amazon cover image
Image from Amazon.com

Formal languages and automata theory / C.K. Nagpal

By: Material type: TextTextPublication details: Oxford, United Kingdom : Oxford University Press, c2011Description: xiv, 348 pages : illustrations ; 24 cmISBN:
  • 9780198071068
Subject(s): LOC classification:
  • QA 267.3 .N34 2011
Contents:
1. Automata, formal languages and computability -- 2. Mathematical preliminaries -- 3. Finite automata -- 4. Regular grammar and regular sets -- 5. Context-free grammars and languages -- 6. Pushdown automata -- 7. Turing machines -- 8. The pitfall of algorithmic computing: undecidability -- 9. Computable functions -- 10. Computational complexity: tractable and possibly intractable problems.
Summary: Formal Languages and Automata theory presents the theoretical aspects of computer science, and helps define infinite languages in finite ways; construct algorithms for related problems and decide whether a string is in language or not. These are of practical importance in construction of compilers and designing of programming languages, thus establishing the course as a core paper in third/fourth year of various universities. This book adopts a holistic approach to learning from fundamentals of formal languages to undecidability problems. Its organization follows the order in which the course is taught over the years, and is well-accepted by the student community. The contents of each topic motivate the reader to easily understand the concepts rather than remember and reproduce.
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 - Graduate Studies General Circulation Gen. Ed. - CCIT GC QA 267.3 .N34 2011 c.2 (Browse shelf(Opens below)) c.2 Available NULIB000011338
Books Books National University - Manila LRC - Main General Circulation Machine Learning GC QA 267.3 .N34 2011 c.1 (Browse shelf(Opens below)) c.1 Available NULIB000009760

Includes index.

1. Automata, formal languages and computability -- 2. Mathematical preliminaries -- 3. Finite automata -- 4. Regular grammar and regular sets -- 5. Context-free grammars and languages -- 6. Pushdown automata -- 7. Turing machines -- 8. The pitfall of algorithmic computing: undecidability -- 9. Computable functions -- 10. Computational complexity: tractable and possibly intractable problems.

Formal Languages and Automata theory presents the theoretical aspects of computer science, and helps define infinite languages in finite ways; construct algorithms for related problems and decide whether a string is in language or not. These are of practical importance in construction of compilers and designing of programming languages, thus establishing the course as a core paper in third/fourth year of various universities. This book adopts a holistic approach to learning from fundamentals of formal languages to undecidability problems. Its organization follows the order in which the course is taught over the years, and is well-accepted by the student community. The contents of each topic motivate the reader to easily understand the concepts rather than remember and reproduce.

There are no comments on this title.

to post a comment.