%0 Book %1 hopcroft07 %A Hopcroft, John E. %A Motwani, Rajeev %A Ullman, Jeffrey D. %C Boston %D 2007 %I Pearson/Addison Wesley %K automata complexity computation gadget np-hardness textbook %T Introduction to Automata Theory, Languages, and Computation %U http://infolab.stanford.edu/~ullman/ialc.html %X "This classic book on formal languages, automata theory, and computational complexity has been updated to present theoretical concepts in a concise and straightforward manner with increased coverage of practical applications. This third edition offers students a less formal writing style while providing the most accessible coverage of automata theory available, solid treatment on constructing proofs, many figures and diagrams to help convey ideas, and sidebars to highlight related material. A new feature of this edition is Gradiance, a Web-based homework and assessment tool. Each chapter offers an abundance of exercises, including selected Gradiance problems, for a true hands-on learning experience for students."--Jacket. %7 Third %@ 0321455363 9780321455369 0321462254 9780321462251 0321455371 9780321455376 0321476174 9780321476173

@book{hopcroft07, abstract = {"This classic book on formal languages, automata theory, and computational complexity has been updated to present theoretical concepts in a concise and straightforward manner with increased coverage of practical applications. This third edition offers students a less formal writing style while providing the most accessible coverage of automata theory available, solid treatment on constructing proofs, many figures and diagrams to help convey ideas, and sidebars to highlight related material. A new feature of this edition is Gradiance, a Web-based homework and assessment tool. Each chapter offers an abundance of exercises, including selected Gradiance problems, for a true hands-on learning experience for students."--Jacket.}, added-at = {2015-09-19T12:13:11.000+0200}, address = {Boston}, author = {Hopcroft, John E. and Motwani, Rajeev and Ullman, Jeffrey D.}, biburl = {https://www.bibsonomy.org/bibtex/23ca9f9f502e6f24ec694ed435fd4556c/ytyoun}, edition = {Third}, interhash = {7360c2600edf9d272b4e876578997f07}, intrahash = {3ca9f9f502e6f24ec694ed435fd4556c}, isbn = {0321455363 9780321455369 0321462254 9780321462251 0321455371 9780321455376 0321476174 9780321476173}, keywords = {automata complexity computation gadget np-hardness textbook}, publisher = {Pearson/Addison Wesley}, refid = {69013079}, timestamp = {2016-06-22T03:39:17.000+0200}, title = {Introduction to Automata Theory, Languages, and Computation}, url = {http://infolab.stanford.edu/~ullman/ialc.html}, year = 2007 }