Automata and Computability

Regular price €49.99
A01=Ganesh Gopalakrishnan
Age Group_Uncategorized
Age Group_Uncategorized
Author_Ganesh Gopalakrishnan
automata theory
automatic-update
autonoma
BDD.
Boolean Function
Boolean Satisfiability
Category1=Non-Fiction
Category=PBD
Category=UMA
Category=UMB
Category=UYA
Category=UYQ
Category=UYZG
Context Free Grammar
Context Free Languages
Context Sensitive Language
COP=United Kingdom
Delivery_Pre-order
derivative-based parsing
Deterministic Finite State Automaton
DFA
discrete math
eq_computing
eq_isMigrated=2
eq_non-fiction
functional programming code
Infinite Tape
Input String
Lambda Calculus
Lambda Expression
Lambda reducer
lambdas
Language_English
Mapping Reduction
NFA
NFA State
Non-final State
PA=Temporarily unavailable
PDA
Price_€20 to €50
Proof Sketch
PS=Active
Pushdown Automaton
Python
Re
Regular Language
SAT Solver
softlaunch
State St3
theory of computation
Turing Machine
Turing machines

Product details

  • ISBN 9780367656546
  • Weight: 640g
  • Dimensions: 210 x 280mm
  • Publication Date: 30 Sep 2020
  • Publisher: Taylor & Francis Ltd
  • Publication City/Country: GB
  • Product Form: Paperback
  • Language: English
Delivery/Collection within 10-20 working days

Our Delivery Time Frames Explained
2-4 Working Days: Available in-stock

10-20 Working Days
: On Backorder

Will Deliver When Available
: On Pre-Order or Reprinting

We ship your order once all items have arrived at our warehouse and are processed. Need those 2-4 day shipping items sooner? Just place a separate order for them!

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.

Ganesh Gopalakrishnan is a professor in the Computer Science Department at the University of Utah.