Jha, Manish Kumar
Automata theory: a step by step approach - 1st - New Delhi S. Chand 2015 - x,462p. | Binding - Paperback |
This textbook has been designed for undergraduate and postgraduate students of computer science and information technology. Aspirants of various competitive examinations such as NET, GATE, DRDO, etc. will also find this book useful. This textbook is written in a very accessible style and analytical explanations for each topic are presented in a very simple language. To make the textbook both versatile and complete, the readers are exposed to the full range of concepts of Automata Theory.
• Presents the essentials of Automata Theory in an easy-to-follow manner.
• Includes intuitive explanations of theoretical concepts, definitions, algorithms, steps and techniques of Automata Theory.
• Examines in detail the foundations of Automata Theory such as Language, DFA, NFA, CFG, Mealy/Moore Machines, Pushdown Automata, Turing Machine, Recursive Function, Lab/Practice Work, etc.
• More than 700 solved questions and about 200 unsolved questions for student's practice.
• Apart from the syllabus of B. Tech (CSE & IT), M. Tech. (CSE & IT), MCA, M. Sc. (CS), BCA, this book covers complete syllabi of GATE (CS), NET and DRDO examinations.
978-93-848-5792-9
Computer Engineering
5.131 / JHA
Automata theory: a step by step approach - 1st - New Delhi S. Chand 2015 - x,462p. | Binding - Paperback |
This textbook has been designed for undergraduate and postgraduate students of computer science and information technology. Aspirants of various competitive examinations such as NET, GATE, DRDO, etc. will also find this book useful. This textbook is written in a very accessible style and analytical explanations for each topic are presented in a very simple language. To make the textbook both versatile and complete, the readers are exposed to the full range of concepts of Automata Theory.
• Presents the essentials of Automata Theory in an easy-to-follow manner.
• Includes intuitive explanations of theoretical concepts, definitions, algorithms, steps and techniques of Automata Theory.
• Examines in detail the foundations of Automata Theory such as Language, DFA, NFA, CFG, Mealy/Moore Machines, Pushdown Automata, Turing Machine, Recursive Function, Lab/Practice Work, etc.
• More than 700 solved questions and about 200 unsolved questions for student's practice.
• Apart from the syllabus of B. Tech (CSE & IT), M. Tech. (CSE & IT), MCA, M. Sc. (CS), BCA, this book covers complete syllabi of GATE (CS), NET and DRDO examinations.
978-93-848-5792-9
Computer Engineering
5.131 / JHA