Code: 33061528

Automata and Computability

Name: Automata and Computability
Brand: Taylor & Francis Ltd
SKU: 33061528
Price: 67.23 EUR
Availability: BackOrder
Author: Ganesh Gopalakrishnan
ISBN: 9780367656546

by Ganesh Gopalakrishnan

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 t ... more

Language: English
Binding: Paperback
Number of pages: 328
Publisher: Taylor & Francis Ltd, 2020
More about this

67.23 €

Availability:

50/50

We think title might be available. Upon your order we will do our best to get it within 6 weeks.
We search the world

Availability alert

Add to wishlist

Greatest Fury
18.09 € -9 %
Buy
Romanticism and Visuality
224.57 €
Buy

Give this book as a present today

Order book and choose Gift Order.
We will send you book gift voucher at once. You can give it out to anyone.
Book will be send to donee, nothing more to care about.

Book gift voucher sample Read more

Availability alert

We will watch availability for you

Enter your e-mail address and once book will be available,
we will send you a message. It's that simple.

You get 163 loyalty points

Book synopsis

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.
All the code can be accessed here.