Introduction to automata theory, languages, and computation, 2nd edition

2001/03/01 by John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman · 449 citations

paper · doi:10.1145/568438.568455

published in ACM SIGACT News 32(1), 60-65 (Association for Computing Machinery (ACM))

crossref issued 2001/03/01 · crossref published 2001/03/01 · crossref published-online 2001/03/01 · crossref published-print 2001/03/01 · crossref created 2004/10/12 · crossref deposited 2025/06/18 · crossref indexed 2026/08/01

Cited by

• On A. V. Anisimov's problem for finding a polynomial algorithm checking inclusion of context-free languages in group languages
• From Historical Puzzles to Grammatical Constraints: Circular Partitions, Generalized Run-Length Encodings, and Polynomial-Time Decidability