Introduction to automata theory, languages, and computation
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 ap...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | Book |
| Language: | English |
| Published: |
Boston
Addison-Wesley
c2001
|
| Edition: | 2nd ed. |
| Subjects: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | 8215 | ||
| 003 | MY-KLNDU | ||
| 005 | 20241218052632.0 | ||
| 008 | 150903 2001 maua bi 000 0 eng d | ||
| 020 | |a 0201441241 | ||
| 039 | 9 | |a 201509031627 |b azraai |y 200910081456 |z VLOAD | |
| 040 | |a UPNM | ||
| 090 | |a QA 267 |b .H56 2001 | ||
| 100 | 1 | |a Hopcroft, John E. |d 1939- | |
| 245 | 1 | 0 | |a Introduction to automata theory, languages, and computation |c John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman |
| 250 | |a 2nd ed. | ||
| 260 | |a Boston |b Addison-Wesley |c c2001 | ||
| 300 | |a xiv, 521 p. |b ill. |c 25 cm | ||
| 504 | |a Includes bibliographical references and index | ||
| 505 | 0 | |a Automata: 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 | |a 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. | ||
| 650 | 0 | |a Machine theory | |
| 650 | 0 | |a Formal languages | |
| 650 | 0 | |a Computational complexity | |
| 700 | 1 | |a Motwani, Rajeev | |
| 700 | 1 | |a Ullman, Jeffrey D. |d 1942- | |
| 999 | |a vtls000008328 |c 8215 |d 8215 | ||