Formal languages and automata theory / C.K. Nagpal
Material type:
- 9780198071068
- QA 267.3 .N34 2011

Item type | Current library | Home library | Collection | Call number | Copy number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|---|---|---|
![]() |
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 | ||
![]() |
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 |
Browsing LRC - Main shelves, Shelving location: General Circulation, Collection: Machine Learning Close shelf browser (Hides shelf browser)
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
||
GC QA 76.73.S67 .M87 2012 Murach's MySQL : training and reference / | GC QA 76.73.S67 .R63 2011 The language of SQL / | GC QA 76.76 .D47 .M87 2016 The complete software project manager / | GC QA 267.3 .N34 2011 c.1 Formal languages and automata theory / | GC QA 267.3 .P37 2002 Introduction to languages, machines and logic : computable languages, abstract machines and formal logic / | GC QA 267.5 .D47 2016 Designing beauty: the art of cellular automata / | GC QA 276.45.R3 .F57 2018 Data analysis with R : a comprehensive guide to manipulating, analyzing, and visualizing data in R / |
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.