TY  - BOOK
AU  - Pandey,Adesh Kumar
TI  - Theory of automata and computation / 
SN  - 9789350141571
AV  - QA267 .P362011
U1  - 005.131 23
PY  - 2011/// ; Reprint 2022
CY  - New Delhi, India
PB  - S.K. Kataria & Sons
KW  - Machine theory
KW  - Computational complexity
KW  - Recursion theory
N1  - Includes index; Section-A: Finite automata -- Regular expression -- Introduction to machines -- Section-B: Properties of regular sets -- Context-free grammars and languages -- Simplified context-free grammar and its normal form -- Section-C: Pushdown automata -- Properties of context-free languages -- Turing machine -- Section-D: Chomsky heirarchies -- Computability and recursive function theory
N2  - "The book addresses a full spectrum of automata theory concepts used in computer science. Each of these concepts is presented in detail, since these concepts are basis of computer science and provide the basics for developing software techniques like designing and checking the behaviour of digital circuits, lexical-analyser of the typical compiler, and software for Natural Language Processing. To introduce the more formal aspects of Computer Science, the author has presented automata as foundation. For students who are ambitious to achieve unparalleled goals in the field of computer science, and want to develop their programming skills towards system programming, it becomes necessary that their mathematical concept are very clear"-- Preface of the book
ER  -