Afficher la notice abrégée

dc.contributor.authorHopcroft, John E.
dc.contributor.authorMotwani, Rajeev
dc.contributor.authorUllman, Jeffrey D.
dc.date.accessioned2015-09-02T00:08:30Z
dc.date.available2015-09-02T00:08:30Z
dc.date.issued2001
dc.identifier.citationAddison Wesley, 2001en_US
dc.identifier.isbn9780201441246
dc.identifier.urihttp://hdl.handle.net/123456789/570
dc.description.abstractIt 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.en_US
dc.language.isoenen_US
dc.publisherAddison Wesleyen_US
dc.subjectMachine theoryen_US
dc.subjectFormal languagesen_US
dc.subjectComputational complexityen_US
dc.titleIntroduction to automata theory, languages and computationen_US
dc.typeBooken_US


Fichier(s) constituant ce document

Thumbnail

Ce document figure dans la(les) collection(s) suivante(s)

Afficher la notice abrégée