000			01641 a2200229 4500
999			_c539 _d539
005			20201211115943.0
008			180809b ||||| |||| 00| 0 eng d
020			_a9788131723562
040			_c0
082			_a519.713 _b KAM
100			_a Krithivasan Kamala
245			_aIntroduction to formal languages, automata theory and computation _cKamala Krithivasan, Rama R.
260			_bPearson _c2009 _aNoida
300			_axiii, 425p _c23cm,
505			_tPreliminaries -- _tGrammars _tFinite State Automata -- _tFinite State Automata: Characterization, Properties, and Decidability -- _tFinite State automata with Output and Minimization -- _tVariants of Finite Automata _t Pushdown Automata -- _tContext-Free Grammars -- properties and parsing -- _tTuring Machine -- _tVariations of Turing Machines -- _tUniversal Turing Machine and Decidability -- _tTime and Space Complexity _t Recent trends and applications -- _tNew Models of Computation.
520			_a Introduction to Formal Languages, Automata Theory and Computation presents the theoretical concepts in a concise and clear manner, with an in-depth coverage of formal grammar and basic automata types. The book also examines the underlying theory and principles of computation and is highly suitable to the undergraduate courses in computer science and information technology. An overview of the recent trends in the field and applications are introduced at the appropriate places to stimulate the interest of active learners.
650			_a Formal languages.
650			_aComputable functions.
650			_aMachine theory.
700			_aR Rama
942			_cBK _2ddc