000			01957nam a22002177a 4500
003			OSt
005			20251216131331.0
008			251216b |||||||| |||| 00| 0 eng d
020			_a9789386235756
040			_cSoET Library
082			_a004.9 SAR
100			_aSarkar, Bikash Kanti _92998
245			_aIntroduction to Theory of Computation
260			_aHimayatnagar: _bUniversity Press, _c2019.
300			_aix, 398 p. : ill.
520			_aThe book introduces readers to Theory of Computation, one of the fundamental pillars of Computer Science, and can be used as a core textbook by undergraduate students of Engineering. It offers a cohesive presentation of all aspects of Theoretical Computer Science, namely, automata, formal languages, computability and complexity. It also covers the mathematical preliminaries necessary for the subject. As Theory of Computation forms an important part of the syllabus of various national and state-level competitive examinations and is also a high-scoring area, several problems from previous competitive examinations have also been included in this book, and shortcut tricks have been provided, where feasible. Salient features Proper mathematical explanation for various computational models, numerous figures, highlighted notes and shortcut tips for easy understanding of ideas Numerous solved examples mapping with other relevant subjects and real-world problems Ideas for research direction and project-based problems at the end of every chapter Key Points to draw attention to the important ideas/concepts discussed Exercises comprising practice problems as well as MCQs at the end of every chapter Competitive examination section with solved examples of several national and state-level competitive examinations, such as GATE, NET, SET and PhD entrance
650			_aTheory of computation _92999
650			_aAutomata theory _93000
700			_aKumar, Ambuj _93001
942			_2ddc _cBK
999			_c10143 _d10143