000			00446nam a2200169Ia 4500
999			_c6838 _d6838
005			20181105113607.0
008			181025s9999 xx 000 0 und d
020			_a978-93-848-5792-9
040			_aAIKTC-KRRC _cAIKTC-KRRC
041			_aENG
082			_a5.131 _bJHA _2DDC23
100			_aJha, Manish Kumar
245		0	_aAutomata theory: a step by step approach
250			_a1st
260			_aNew Delhi _bS. Chand _c2015
300			_ax,462p. _bPaperback
521			_aThis 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.
650			_94622 _aComputer Engineering
942			_cBK _2ddc