000			01800nam a2200241Ia 4500
003			NULRC
005			20250520100631.0
008			250520s9999 xx 000 0 und d
020			_a9814096512
040			_cNULRC
050			_aQA 267 .H67 2001
100			_aHopcroft, John E. _eauthor
245		0	_aIntroduction to automata theory, languages, and computation / _cJohn E. Hopcroft, Rajeev Motwani and Jeffrey D. Ullman.
250			_aSecond edition. | Low price edition.
260			_aBoston, Massachusetts : _bAddision-Wesley Publishing Company, _cc2001
300			_axiv, 521 pages : _billustrations ; _c25 cm
504			_aIncludes bibliographical references (pages 510-511) and index.
505			_aAutomata: The Methods and the Madness -- Finite Automata -- Regular Expressions and Languages -- Properties of Regular Languages -- Context-Free Grammars and Languages -- Pushdown Automata -- Properties of Context-Free Languages.
520			_aIt has been more than 20 years since this classic book on formal languages, automata theory, and computational complexity was first published. With this long-awaited revision, the authors continue to present the theory in a concise and straightforward manner, now with an eye out for the practical applications. They have revised this book to make it more accessible to today's students, including the addition of more material on writing proofs, more figures and pictures to convey ideas, side-boxes to highlight other interesting material, and a less formal writing style. Exercises at the end of each chapter, including some new, easier exercises, help readers confirm and enhance their understanding of the material.
650			_aMACHINE THEORY
700			_aMotwani, Rajeev ;Ullman, Jeffrey D. _eco-author;co-author
942			_2lcc _cBK
999			_c10034 _d10034