Introduction to automata theory, languages and computation

Hopcroft, John E.; Motwani, Rajeev; Ullman, Jeffrey D.

dc.contributor.author	Hopcroft, John E.
dc.contributor.author	Motwani, Rajeev
dc.contributor.author	Ullman, Jeffrey D.
dc.date.accessioned	2015-09-02T00:08:30Z
dc.date.available	2015-09-02T00:08:30Z
dc.date.issued	2001
dc.identifier.citation	Addison Wesley, 2001	en_US
dc.identifier.isbn	9780201441246
dc.identifier.uri	http://hdl.handle.net/123456789/570
dc.description.abstract	It 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.iso	en	en_US
dc.publisher	Addison Wesley	en_US
dc.subject	Machine theory	en_US
dc.subject	Formal languages	en_US
dc.subject	Computational complexity	en_US
dc.title	Introduction to automata theory, languages and computation	en_US
dc.type	Book	en_US