Search results
Results from the WOW.Com Content Network
The forerunner of this book appeared under the title Formal Languages and Their Relation to Automata 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 automata theory for over a decade, cf. (Hopcroft 1989).
John Edward Hopcroft (born October 7, 1939) is an American theoretical computer scientist. His textbooks on theory of computation (also known as the Cinderella book ) and data structures are regarded as standards in their fields.
He was an author of two widely used theoretical computer science textbooks: Randomized Algorithms with Prabhakar Raghavan [9] and Introduction to Automata Theory, Languages, and Computation with John Hopcroft and Jeffrey Ullman. [10] He was an avid angel investor and helped fund a number of startups to emerge from Stanford.
This template is used to cite the 2006 (3rd) edition of Introduction to Automata Theory, Languages, and Computation, by Hopcroft, Motwani, and Ullman. See also [ edit ]
Introduction to Automata Theory, Languages, and Computation ... edition of Introduction to Automata Theory, Languages, and ... Hopcroft, Motwani, and Ullman ...
Seymour Ginsburg, Algebraic and automata theoretic properties of formal languages, North-Holland, 1975, ISBN 0-7204-2506-9. John E. Hopcroft and Jeffrey D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley Publishing, Reading Massachusetts, 1979. ISBN 0-201-02988-X. Chapter 11: Closure properties of families of ...
Ullman is the co-recipient (with John Hopcroft) of the 2010 IEEE John von Neumann Medal "For laying the foundations for the fields of automata and language theory and many seminal contributions to theoretical computer science." [6] Ullman, Hopcroft, and Alfred Aho were co-recipients of the 2017 C&C Prize awarded by NEC Corporation. [7]
Automata Theory: An Engineering Approach. New York: Crane Russak. ISBN 978-0-8448-0657-0. Marvin Minsky (1967). Computation: Finite and infinite machines. Princeton, N.J.: Prentice Hall. John C. Martin (2011). Introduction to Languages and The Theory of Computation. New York: McGraw Hill. ISBN 978-0-07-319146-1.