Introduction to automata theory, languages, and computation
Publication details: New Delhi : Narosa Publication, 1987.Description: 418 pages : ill.; 23 cmISBN:- 8185015961
- 629.831 HOP
Item type | Current library | Collection | Call number | Status | Date due | Barcode |
---|---|---|---|---|---|---|
Gratis, Gifts | IIITDM Kurnool General Stacks | Non-fiction | 629.831 HOP (Browse shelf(Opens below)) | Available | G000121 |
Finite automata and regular expressions --
Properties of regular sets --
Context-free grammars --
Pushdown automata --
Properties of context-free languages --
Turing machines --
Undecidability --
The Chomsky hierarchy --
Deterministic context-free languages --
Closure properties of families of languages --
Computational complexity theory --
Intractable problems --
Highlights of other important language classes.
This book presents automata theory, formal languages, and computational complexity as a coherent theory. It includes end-of-chapter questions, bibliographies, and exercises. Problems of highest and intermediate difficulty are marked respectively with double or single stars.
There are no comments on this title.