000			01440nam a22002297a 4500
999			_c772 _d772
005			20200831145123.0
008			190125b ||||| |||| 00| 0 eng d
020			_a9789384323219
040			_c0
082			_a519.736 _bLIN
100			_aLinz, Peter
245			_aIntroduction to formal languages and automata _cPeter Linz.
246			_aIntroduction to formal languages & automata
250			_a6th ed.,
260			_aNew delhi, _bJones and Bartlett India pvt.ltd, _c2018
300			_a449p, _c23cm.,
505			_tIntroduction to the theory of computation -- _tFinite automata -- _tRegular languages and regular grammars -- _tProperties of regular languages -- _tContext-free languages -- _tSimplification of context-free grammars and Normal Forms-- _tPushdown automata -- _tProperties of context-free languages -- _tTuring machines -- _tOther models of Turing machines -- _tA hierarchy of formal languages and automata -- _tLimits of algorithmic computation -- _tOther models of computation -- _tAn overview to computational complexity.
520			_aFormal languages, automata, computability, and related matters form the major part of the theory of computation. This textbook is designed for an introductory course for computer science and computer engineering majors who have knowledge of some higher-level programming language,
650			_a Formal languages.
650			_a Machine theory.
942			_2ddc _cBK