Introduction to Automata Theory, Languages, and Computation Export

@book{HMU00, abstract = {This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity. The authors present the theory in a concise and straightforward manner, with an eye out for the practical applications. Exercises at the end of each chapter, including some that have been solved, help readers confirm and enhance their understanding of the material. This book is appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.}, author = {Hopcroft, John E. and Motwani, Rajeev and Ullman, Jeffrey D.}, citeulike-article-id = {310136}, citeulike-linkout-0 = {http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20&path=ASIN/0201441241}, citeulike-linkout-1 = {http://www.amazon.de/exec/obidos/redirect?tag=citeulike01-21&path=ASIN/0201441241}, citeulike-linkout-2 = {http://www.amazon.fr/exec/obidos/redirect?tag=citeulike06-21&path=ASIN/0201441241}, citeulike-linkout-3 = {http://www.amazon.jp/exec/obidos/ASIN/0201441241}, citeulike-linkout-4 = {http://www.amazon.co.uk/exec/obidos/ASIN/0201441241/citeulike00-21}, citeulike-linkout-5 = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20&path=ASIN/0201441241}, citeulike-linkout-6 = {http://www.worldcat.org/isbn/0201441241}, citeulike-linkout-7 = {http://books.google.com/books?vid=ISBN0201441241}, citeulike-linkout-8 = {http://www.amazon.com/gp/search?keywords=0201441241&index=books&linkCode=qs}, citeulike-linkout-9 = {http://www.librarything.com/isbn/0201441241}, day = {14}, edition = {2nd}, howpublished = {Hardcover}, isbn = {0201441241}, keywords = {automata, complexity, computational, grammars}, month = {November}, posted-at = {2008-04-23 18:21:50}, priority = {0}, publisher = {Addison Wesley}, title = {Introduction to Automata Theory, Languages, and Computation}, url = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20&path=ASIN/0201441241}, year = {2000} }

TY - BOOK ID - HMU00 L3 - citeulike-article-id:310136 N2 - This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity. The authors present the theory in a concise and straightforward manner, with an eye out for the practical applications. Exercises at the end of each chapter, including some that have been solved, help readers confirm and enhance their understanding of the material. This book is appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments. SN - 0201441241 TI - Introduction to Automata Theory, Languages, and Computation PB - Addison Wesley KW - automata KW - complexity KW - computational KW - grammars AU - Hopcroft, John AU - Motwani, Rajeev AU - Ullman, Jeffrey PY - 2000/11/14/ UR - http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20&path=ASIN/0201441241 ER -