000			01487nam a22002537a 4500
003			CUTN
005			20250531131532.0
008			250531b |||||||| |||| 00| 0 eng d
020			_a9788180940767
041			_aEnglish
082			_2First _a005.1 _bACH
100			_aAcharjya D.P
245			_aTheory of Computation / _c D.P Acharjya
260			_aChennai : _bMJP Publisher, _c2010.
300			_a396 p. : _bill. ; _c8 x 0.94 x 10 inches.
505			_aIntroduction to Theory of Computation Mathematical Preliminaries Finite Automata Regular Languages and Expressions Context-Free Languages Pushdown Automata Turing Machines Chomsky Hierarchy and Grammar Classification Decidability and Computability Complexity Theory Parsing Techniques (LR, LL Grammars)
520			_aTheory of Computation by D. P. Acharjya explores the mathematical foundations and principles underlying computation and automata theory. The book covers core topics such as formal languages, automata models, Turing machines, and decidability. It emphasizes mathematical rigor and problem-solving techniques essential for understanding what problems can be solved computationally and how efficiently. The text is structured to help students grasp complex theoretical concepts through clear explanations and examples.
650			_aAutomata Theory
650			_aFormal Languages
650			_aTuring Machines
650			_aFinite Automata
650			_aPushdown Automata
942			_2ddc _cBOOKS
999			_c44524 _d44524