Formal Languages and Automata Theory K V N Sunitha; N Kalyani
Material type: TextLanguage: English Series: Always LearningPublication details: Chennai : Pearson, ©2015.Description: Chennai : Pearson Education, 2015ISSN:- 9789332537286
- 511.3 SUN
Item type | Current library | Collection | Call number | Status | Date due | Barcode |
---|---|---|---|---|---|---|
General Books | CUTN Central Library Sciences | Non-fiction | 511.3 SUN (Browse shelf(Opens below)) | Available | 36669 |
Mathematical Preliminaries and Formal Languages
Finite Automata
Regular Languages and Regular Grammars
Context Free Grammars and Context Free Languages
Push Down Automata
Turing Machines
Undecidability and Computability
Non-deterministic Polynomial Completeness
LR(k) and LL(1) Grammars
Formal Languages and Automata Theory deals with the mathematical abstraction model of computation and its relation to formal languages. This book is intended to expose students to the theoretical development of computer science. It also provides conceptual tools that practitioners use in computer engineering. An assortment of problems illustrative of each method is solved in all possible ways for the benefit of students. The book also presents challenging exercises designed to hone the analytical skills of students.
There are no comments on this title.