000			01227nam a22002297a 4500
003			IIITD
005			20240409183018.0
008			240409b xxu||||| |||| 00| 0 eng d
020			_a9789384323219
040			_aIIITD
082			_a005.13 _bLIN-I
100			_aLinz, Peter
245			_aAn introduction to formal languages and automata _cby Peter Linz.
250			_a4th ed.
260			_aSudbury, Mass. : _bJones and Bartlett Publishers, _c©2023
300			_axiii, 415 p. : _b ill. ; _c25 cm.
505			_aIncludes bibliographical references and index. _t1 Introduction to the Theory of Computation _t2 Finite Automata _t3 Regular Languages and Regular Grammars _t4 Properties of Regular Languages _t5 Context-Free Languages _t6 Simplification of Context-Free Grammars and Normal Forms _t7 Pushdown Automata _t8 Properties of Context-Free Languages _t9 Turing Machines _t10 Other Models of Turing Machines _t11 A Hierarchy of Formal Languages And Automata _t12 Limits of Algorithmic Computation _t13 Other Models of Computation _t14 An Overview of Computational Complexity
650			_aEnterprise Data Computing
650			_aComputer Programming Languages
650			_a Microsoft Programming
942			_2ddc _cBK
999			_c172638 _d172638