Knowledge (XXG)

Introduction to Automata Theory, Languages, and Computation

Source 📝

442:. It was published in 1968 and is referred to in the introduction of the 1979 edition. In a personal historical note regarding the 1968 book, Hopcroft states: "Perhaps the success of the book came from our efforts to present the essence of each proof before actually giving the proof" (Hopcroft 1989). Compared with the forerunner book, the 1979 edition was expanded, and the material was reworked to make it more accessible to students, cf. (Hopcroft 1989). This gearing towards understandability at the price of succinctness was not seen positively by all. As Hopcroft reports on feedback to the overhauled 1979 edition: "It seems that our attempts to lower the level of our presentation for the benefit of students by including more detail and explanations had an adverse effect on the faculty, who then had to sift through the added material to outline and prepare their lectures" (Hopcroft 1989). 25: 408: 97: 430:
is applied, whereas large parts of more advanced theory were taken out. While this makes the second and third editions more accessible to beginners, it makes it less suited for more advanced courses. The new bias away from theory is not seen positively by all: As
54: 459: 587: 426:
has joined Hopcroft and Ullman as the third author. Starting with the second edition, the book features extended coverage of examples where
277:
device and holding a rope coming out of it. On the back cover, the device is in shambles after she has (inevitably) pulled on the rope."
622: 96: 422:
was published in 1979, the second edition in November 2000, and the third edition appeared in February 2006. Since the second edition,
291:
in 1968. Forming a basis both for the creation of courses on the topic, as well as for further research, that book shaped the field of
397: 378: 355: 336: 313: 180: 76: 657: 652: 647: 642: 637: 632: 438:
The first edition in turn constituted a major revision of a previous textbook also written by Hopcroft and Ullman, entitled
605: 512: 555:"The emergence of computer science - A citation classic commentary on 'Formal Languages and Their Relation to Automata'" 202: 37: 47: 41: 33: 627: 58: 248: 569: 273:, thusly: "So called because the cover depicts a girl (putatively Cinderella) sitting in front of a 554: 445:
Still, the most cited edition of the book is apparently the 1979 edition: According to the website
583: 491: 393: 374: 351: 332: 309: 187: 175: 559: 232: 213: 132: 575: 546: 542: 432: 427: 292: 244: 470: 464: 423: 367: 252: 240: 142: 114: 449:, over 3000 scientific papers freely available online cite this edition of the book. 616: 325: 302: 274: 236: 110: 407: 597: 264: 516: 446: 435:
quotes one professor, "they have removed all good parts." (Shallit 2008).
598:"Introduction to Automata Theory, Languages, and Computation - Home page" 194: 406: 388:
Hopcroft, John E.; Motwani, Rajeev; Ullman, Jeffrey D. (2013).
365:
Hopcroft, John E.; Motwani, Rajeev; Ullman, Jeffrey D. (2006).
346:
Hopcroft, John E.; Motwani, Rajeev; Ullman, Jeffrey D. (2000).
560:
Current Contents Engineering, Technology, and Applied Sciences
18: 188: 90:
Introduction to Automata Theory, Languages, and Computation
420:
Introduction to Automata Theory, Languages, and Computation
390:
Introduction to Automata Theory, Languages, and Computation
369:
Introduction to Automata Theory, Languages, and Computation
348:
Introduction to Automata Theory, Languages, and Computation
327:
Introduction to Automata Theory, Languages, and Computation
228:
Introduction to Automata Theory, Languages, and Computation
214: 580:
A Second Course in Formal Languages and Automata Theory
285:
The forerunner of this book appeared under the title
212: 200: 186: 174: 166: 158: 148: 138: 128: 120: 106: 366: 324: 301: 513:"CiteSeerX Most Cited Computer Science Citations" 255:contributed to later editions beginning in 2000. 46:but its sources remain unclear because it lacks 440:Formal Languages and Their Relation to Automata 412:Formal Languages and Their Relation to Automata 304:Formal Languages and Their Relation to Automata 288:Formal Languages and Their Relation to Automata 323:Hopcroft, John E.; Ullman, Jeffrey D. (1979). 300:Hopcroft, John E.; Ullman, Jeffrey D. (1968). 8: 89: 101:Cover of the Cinderella Book (1979 edition) 582:. Cambridge University Press. p. ix. 95: 88: 460:Introduction to the Theory of Computation 414:appeared in 1968, with an inornate cover. 77:Learn how and when to remove this message 467:, another standard textbook in the field 295:for over a decade, cf. (Hopcroft 1989). 483: 7: 549:(version 4.4.7, December 29, 2003). 14: 608:from the original on 7 June 2023. 373:(3rd ed.). Addison-Wesley. 350:(2nd ed.). Addison-Wesley. 331:(1st ed.). Addison-Wesley. 23: 471:Solutions to Selected Exercises 16:1979 computer science textbook 1: 281:Edition history and reception 267:records the book's nickname, 674: 623:Computer science textbooks 553:Hopcroft, John E. (1989). 392:(3rd ed.). Pearson. 94: 32:This article includes a 61:more precise citations. 658:2016 non-fiction books 653:2006 non-fiction books 648:2000 non-fiction books 643:1979 non-fiction books 638:1968 non-fiction books 633:Automata (computation) 570:available online (pdf) 415: 473:, Stanford University 418:The first edition of 410: 249:theory of computation 602:Stanford University 576:Shallit, Jeffrey O. 91: 543:"Cinderella book". 416: 308:. Addison-Wesley. 231:is an influential 34:list of references 589:978-0-521-86572-2 492:"Cinderella Book" 224: 223: 159:Publication place 87: 86: 79: 665: 628:Formal languages 609: 593: 568: 529: 528: 526: 524: 515:. Archived from 509: 503: 502: 500: 498: 488: 403: 384: 372: 361: 342: 330: 319: 307: 245:formal languages 233:computer science 216: 190: 150:Publication date 133:Computer science 99: 92: 82: 75: 71: 68: 62: 57:this article by 48:inline citations 27: 26: 19: 673: 672: 668: 667: 666: 664: 663: 662: 613: 612: 596: 590: 574: 552: 547:The Jargon file 538: 533: 532: 522: 520: 519:on Sep 21, 2022 511: 510: 506: 496: 494: 490: 489: 485: 480: 455: 428:automata theory 400: 387: 381: 364: 358: 345: 339: 322: 316: 299: 293:automata theory 283: 270:Cinderella Book 261: 205: 167:Media type 151: 102: 83: 72: 66: 63: 52: 38:related reading 28: 24: 17: 12: 11: 5: 671: 669: 661: 660: 655: 650: 645: 640: 635: 630: 625: 615: 614: 611: 610: 594: 588: 572: 550: 537: 536:External links 534: 531: 530: 504: 482: 481: 479: 476: 475: 474: 468: 465:Michael Sipser 454: 451: 424:Rajeev Motwani 405: 404: 399:978-1292039053 398: 385: 379: 362: 356: 343: 337: 320: 314: 282: 279: 260: 257: 253:Rajeev Motwani 241:Jeffrey Ullman 222: 221: 218: 210: 209: 206: 201: 198: 197: 192: 184: 183: 178: 172: 171: 168: 164: 163: 160: 156: 155: 152: 149: 146: 145: 143:Addison-Wesley 140: 136: 135: 130: 126: 125: 122: 118: 117: 115:Jeffrey Ullman 108: 104: 103: 100: 85: 84: 42:external links 31: 29: 22: 15: 13: 10: 9: 6: 4: 3: 2: 670: 659: 656: 654: 651: 649: 646: 644: 641: 639: 636: 634: 631: 629: 626: 624: 621: 620: 618: 607: 603: 599: 595: 591: 585: 581: 577: 573: 571: 566: 562: 561: 556: 551: 548: 544: 540: 539: 535: 518: 514: 508: 505: 493: 487: 484: 477: 472: 469: 466: 462: 461: 457: 456: 452: 450: 448: 443: 441: 436: 434: 429: 425: 421: 413: 409: 401: 395: 391: 386: 382: 380:0-321-45536-3 376: 371: 370: 363: 359: 357:81-7808-347-7 353: 349: 344: 340: 338:0-201-02988-X 334: 329: 328: 321: 317: 315:9780201029833 311: 306: 305: 298: 297: 296: 294: 290: 289: 280: 278: 276: 275:Rube Goldberg 272: 271: 266: 258: 256: 254: 250: 246: 242: 238: 237:John Hopcroft 234: 230: 229: 219: 217: 215:LC Class 211: 207: 204: 203:Dewey Decimal 199: 196: 193: 191: 185: 182: 181:0-201-02988-X 179: 177: 173: 169: 165: 161: 157: 153: 147: 144: 141: 137: 134: 131: 127: 123: 119: 116: 112: 111:John Hopcroft 109: 105: 98: 93: 81: 78: 70: 67:December 2011 60: 56: 50: 49: 43: 39: 35: 30: 21: 20: 601: 579: 564: 558: 521:. Retrieved 517:the original 507: 495:. Retrieved 486: 458: 444: 439: 437: 419: 417: 411: 389: 368: 347: 326: 303: 287: 286: 284: 269: 268: 262: 235:textbook by 227: 226: 225: 73: 64: 53:Please help 45: 265:Jargon File 59:introducing 617:Categories 478:References 220:QA267 .H56 447:CiteSeerX 208:629.8/312 139:Publisher 606:Archived 578:(2008). 497:July 22, 453:See also 259:Nickname 247:and the 121:Language 523:May 20, 433:Shallit 195:4549363 129:Subject 124:English 55:improve 586:  541:Entry 396:  377:  354:  335:  312:  107:Author 567:: 12. 170:Print 40:, or 584:ISBN 545:In: 525:2009 499:2020 394:ISBN 375:ISBN 352:ISBN 333:ISBN 310:ISBN 263:The 239:and 189:OCLC 176:ISBN 154:1979 113:and 463:by 251:. 243:on 162:USA 619:: 604:. 600:. 565:31 563:. 557:. 44:, 36:, 592:. 527:. 501:. 402:. 383:. 360:. 341:. 318:. 80:) 74:( 69:) 65:( 51:.

Index

list of references
related reading
external links
inline citations
improve
introducing
Learn how and when to remove this message

John Hopcroft
Jeffrey Ullman
Computer science
Addison-Wesley
ISBN
0-201-02988-X
OCLC
4549363
Dewey Decimal
LC Class
computer science
John Hopcroft
Jeffrey Ullman
formal languages
theory of computation
Rajeev Motwani
Jargon File
Rube Goldberg
automata theory
Formal Languages and Their Relation to Automata
ISBN
9780201029833

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.