Automata and Computability: A Programmer’s Perspective
Authors: Ganesh Gopalakrishnan
ISBN-10: 1138552429
ISBN-13: 9781138552425
Edition 版次: 1
Publication Date 出版日期: 2019-02-22
Print Length 页数: 348 pages
Book Description
By finelybook
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.
Contents
Foreword
Preface
Acknowledgments
1: What Machines Think
2: Defining Languages: Patterns in Sets of Strings
3: Kleene Star: Basic Method of Defining Repetitious Patterns
4: Basics of DFA
5: Designing DFA
6: Operations on DFA
7: Nondeterministic Finite Automata
8: Regular Expressions and NFA
9: NFA to RE Conversion
10: Derivative-Based Regular Expression Matching
11: Context-Free Languages and Grammars
12: Pushdown Automata
13: Turing Machines
14: Interplay between Formal Languages
15: Post Correspondence,and Other Undecidability Proofs
16: NP-Completeness
17: Binary Decision Diagrams as Minimal DFA
18: Computability Using Lambdas
Appendices
Selected References
Index
