3 Review(s)

Introduction To Automata Theory, Languages, And Computation : For Anna University is a book that thoroughly covers formal computer languages as well as the theory of computation. Summary Of The Book Introduction To Automata Theory, Languages, And Computation : For Anna University was first published in the year 1979. It is one of the most popular computer science textbooks and it focuses on formal languages and the theory of computation. This edition not just covers the fundamental theory comprehensively, but also has many new practical applications weaved in. Automata theory is the study of abstract computing devices. The authors have used straightforward and lucid language in this textbook. Some chapters are Automata: The Methods and the Madness, Properties of Regular Languages, Properties of Context-Free Languages, and Undecidability. The book also includes programs like notation for PDAs and Turing machines. Students will find that many figures have been placed along with the content to help convey ideas more clearly. In addition to this, definitions and proofs have been covered in detail as well. Chapters have sidebars in which important points are highlighted. Introduction To Automata Theory, Languages, And Computation : For Anna University has questions based on different levels of difficulty. After a chapter ends, students have the opportunity to solve exercise questions that will give them hands-on learning. Certain root questions have been designed so that students and teachers can have discussions about their solutions. Readers can also try out the online tutorial system, where additional practice sets have been listed. This new edition of Introduction To Automata Theory, Languages, And Computation : For Anna University has a less formal approach to the subject than the previous ones. The experts of the field call this guide the Cinderella Book, as the original book had a cover depicting a girl with a Rube Goldberg machine. Packed with examples and exercises, this textbook is considered a must for computer science students. About The Authors John E. Hopcroft, born in the year 1939, is an American theoretical computer scientist. Hopcroft and Jeffrey Ullman have co-authored Data Structures And Algorithms and The Design And Analysis Of Computer Algorithms. He did his Ph.D. from Stanford University and is currently a Professor of Engineering and Applied Mathematics at Cornell University. In 2010, Hopcroft received the IEEE John von Neumann Medal along with Ullman. Jeffrey Ullman, born in 1942, is an author and a computer scientist. Ullman has authored many textbooks, some of which are Database Systems: The Complete Book, Elements Of ML Programming, Principles Of Database And Knowledge-Base Systems, and Fundamental Concepts Of Programming Systems. He did his Ph.D. from Princeton University in the discipline of Electrical Engineering and is now a Stanford University Professor. He received the Knuth Prize in 2000. Rajeev Motwani, born in 1962, completed his B.Tech from Indian Institute of Technology, Kanpur. He did his Ph.D. in Computer Science from U.C. Berkeley. Later, he became a professor at Stanford University. Motwani was an advisor to companies like Paypal and Google. In 2001, he won the Gödel Prize. He was on the Board of Directors of many big companies like Google, Mimosa Systems, Baynote and few others. He tragically passed away in the year 2009.