Abbey's Bookshop Logo
Go to my checkout basket
Login to Abbey's Bookshop
Register with Abbey's Bookshop
Gift Vouchers
Browse by Category

facebook
Google Book Preview
Automata and Computability: A Programmer's Perspective
— —
Ganesh Gopalakrishnan
Automata and Computability: A Programmer's Perspective by Ganesh Gopalakrishnan at Abbey's Bookshop,

Automata and Computability: A Programmer's Perspective

Ganesh Gopalakrishnan


9781138552425

CRC Press


Discrete mathematics;
Algorithms & data structures;
Mathematical theory of computation;
Artificial intelligence;
User interface design & usability


Hardback

328 pages

$126.00
We can order this in for you
How long will it take?
order qty:  
Add this item to my basket

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 Uses 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 calculus Shows how to sculpt automata by making the regular language conversion pipeline available through simple command interface Uses 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 math Provides 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.

By:   Ganesh Gopalakrishnan
Imprint:   CRC Press
Country of Publication:   United Kingdom
Dimensions:   Height: 279mm,  Width: 216mm, 
Weight:   1.098kg
ISBN:   9781138552425
ISBN 10:   1138552429
Pages:   328
Publication Date:   February 2019
Audience:   College/higher education ,  Primary & secondary/elementary & high school ,  Primary
Format:   Hardback
Publisher's Status:   Active

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 more useful, understanding of the theory. -Dr. Ching-Tsun Chou, Silicon Architecture Engineer, Intel Corporation

My Shopping Basket
Your cart does not contain any items.