Automata and Computability is a class-tested textbook which provides a comprehensive and accessible introduction to the theory of automata and computation. The author uses illustrations, engaging examples, and historical remarks to make the material interesting and relevant for students. It incorporates modern/handy ideas, such as derivative-based parsing and a Lambda reducer showing the universality of Lambda calculus. The book also shows how to sculpt automata by making the regular language conversion pipeline available through a simple command interface. A Jupyter notebook will accompany the book to feature code, YouTube videos, and other supplements to assist instructors and students.
Features
"synopsis" may belong to another edition of this title.
Ganesh Gopalakrishnan is a professor in the Computer Science Department at the University of Utah.
"I have taught formal languages and automata theory for decades, and I have seen many, perhaps most, students struggle with the material because it is so abstract. I've often thought that computer science students would learn it better by programming it. Indeed, that's how I really learned these topics -- by implementing constructions directly in practical compiler generation and formal verification tools to do my research. Prof. Gopalakrishnan's approach is to have students learn by doing, while still going into greater depth than some purely pencil-and-paper courses."
-Prof. David L. Dill, Donald E. Knuth Professor, Emeritus, in the School of Engineering, Stanford University
"It is probably a safe assumption to make these days that many, if not most, computer science undergraduates have had programming experience, but few of them know the language of mathematics. Professor Gopalakrishnan’s book builds on the student’s experience in programming and animates the theory of automata, formal languages, and computability with actual programs which the student can easily modify and play with. Doing is the best way of learning. This book should enable the typical computer science student to acquire a more visceral, and therefore in the long run more useful, understanding of the theory."
-Dr. Ching-Tsun Chou, Silicon Architecture Engineer, Intel Corporation
"As a long-time researcher in programming languages and high-performance computing, I find the coverage of Automata and Computability in this book illuminating from a foundational perspective as well as timely from a practical perspective. In addition to classical topics such as automata theory and parsing, it allows a student to interactively study via Jupyter notebooks a wide range of topics including grammar disambiguation, Boolean satisfiability, Post Correspondence and Lambda Calculus --- all important topics for students who aspire to become proficient in computer science."
-Vivek Sarkar, Professor, School of Computer Science & Stephen Fleming Chair for Telecommunications, College of Computing, Georgia Institute of Technology
"About this title" may belong to another edition of this title.
Shipping:
US$ 2.64
Within U.S.A.
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 30615925-n
Quantity: 1 available
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # FT-9781138552425
Quantity: 10 available
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. pp. 348. Seller Inventory # 370855660
Quantity: 1 available
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # FT-9781138552425
Quantity: 10 available
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. pp. 348. Seller Inventory # 18376271161
Quantity: 1 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition. Seller Inventory # 30615925
Quantity: 1 available
Seller: Chiron Media, Wallingford, United Kingdom
Hardcover. Condition: New. Seller Inventory # 6666-TNF-9781138552425
Quantity: 10 available
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Hardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. Seller Inventory # C9781138552425
Quantity: 5 available
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New. Seller Inventory # 30615925-n
Quantity: Over 20 available
Seller: Grand Eagle Retail, Fairfield, OH, U.S.A.
Hardcover. Condition: new. Hardcover. Automata and Computability is a class-tested textbook which provides a comprehensive and accessible introduction to the theory of automata and computation. The author uses illustrations, engaging examples, and historical remarks to make the material interesting and relevant for students. It incorporates modern/handy ideas, such as derivative-based parsing and a Lambda reducer showing the universality of Lambda calculus. The book also shows how to sculpt automata by making the regular language conversion pipeline available through a simple command interface. A Jupyter notebook will accompany the book to feature code, YouTube videos, and other supplements to assist instructors and studentsFeaturesUses illustrations, engaging examples, and historical remarks to make the material accessible Incorporates modern/handy ideas, such as derivative-based parsing and a Lambda reducer showing the universality of Lambda calculusShows how to "sculpt" automata by making the regular language conversion pipeline available through simple command interfaceUses a mini functional programming (FP) notation consisting of lambdas, maps, filters, and set comprehension (supported in Python) to convey math through PL constructs that are succinct and resemble mathProvides all concepts are encoded in a compact Functional Programming code that will tesselate with Latex markup and Jupyter widgets in a document that will accompany the books. Students can run code effortlessly href="git/"here. This class-tested textbook provides a comprehensive and accessible introduction to the theory of automata and computation. It incorporates modern/handy ideas, such as derivative-based parsing and a Lambda reducer showing the universality of Lambda calculus. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9781138552425
Quantity: 1 available