000			01810nam a2200229Ia 4500
003			NULRC
005			20250520100715.0
008			250520s9999 xx 000 0 und d
020			_a9780198071068
040			_cNULRC
050			_aQA 267.3 .N34 2011
100			_aNagpal, C.K. _eauthor
245		0	_aFormal languages and automata theory / _cC.K. Nagpal
260			_aOxford, United Kingdom : _bOxford University Press, _cc2011
300			_axiv, 348 pages : _billustrations ; _c24 cm.
365			_bUSD8.42
504			_aIncludes index.
505			_a1. Automata, formal languages and computability -- 2. Mathematical preliminaries -- 3. Finite automata -- 4. Regular grammar and regular sets -- 5. Context-free grammars and languages -- 6. Pushdown automata -- 7. Turing machines -- 8. The pitfall of algorithmic computing: undecidability -- 9. Computable functions -- 10. Computational complexity: tractable and possibly intractable problems.
520			_aFormal Languages and Automata theory presents the theoretical aspects of computer science, and helps define infinite languages in finite ways; construct algorithms for related problems and decide whether a string is in language or not. These are of practical importance in construction of compilers and designing of programming languages, thus establishing the course as a core paper in third/fourth year of various universities. This book adopts a holistic approach to learning from fundamentals of formal languages to undecidability problems. Its organization follows the order in which the course is taught over the years, and is well-accepted by the student community. The contents of each topic motivate the reader to easily understand the concepts rather than remember and reproduce.
650			_aFORMAL LANGUAGES
942			_2lcc _cBK
999			_c12001 _d12001