Understanding Automata and Computability 1011010010, 0100101101

Table of contents :
Preface vii

Lectures 1

Introduction

Course Roadmap and Historical Perspective . 3
Strings and Sets . . . . . . . . . . . . . . . . 7

Finite Automata and Regular Sets

3


Finite Automata and Regular Sets


14

4


More on Regular Sets . . . . . . .


19

5


Nondeterministic Finite Automata


25

6


The Subset Construction . . . . . .


32

7


Pattern Matching . . . . . . . . . .


40

8


Pattern Matching and Regular Expressions


44

9


Regular Expressions and Finite Automata .


49

A


Kleene Algebra and Regular Expressions .


55

10


Homomorphisms . . . . . . . . .


61

11


Limitations of Finite Automata .


67

12


Using the Pumping Lemma


72

13


DFA State Minimization ..


77

14


A Minimization Algorithm.


84

15


Myhill-Nerode Relations ..


89

16


The Myhill-Nerode Theorem


95

xii Contents

Collapsing Nondeterministic Automata. . . . . . . 100
Automata on Terms . . . . . . . . . . . . . . . . . 108
The Myhill-Nerode Theorem for Term Automata . 114

Two-Way Finite Automata 119
2DFAs and Regular Sets . . . . . . . . . . . . . . . 124

Pushdown Automata and Context-Free Languages

Context-Free Grammars and Languages 129
Balanced Parentheses . . . . . . 135
Normal Forms. . . . . . . . . . . 140
The Pumping Lemma for CFLs . 148
Pushdown Automata. . . . . . . 157

Final State Versus Empty Stack . 164

PDAs and CFGs . . . . . . . . . 167
Simulating NPDAs by CFGs . . 172

Deterministic Pushdown Automata . 176

Parsing . . . . . . . . . . . . . . . . 181
The Cocke-Kasami-Younger Algorithm 191

The Chomsky-Schiitzenberger Theorem 198
Parikh's Theorem. . . . . . . . . . . 201

Turing Machines and Effective Computability

Turing Machines and Effective Computability 206
More on Turing Machines . . . . . . . . 215
Equivalent Models . . . . . . . . . . . . 221
Universal Machines and Diagonalization 228
Decidable and Undecidable Problems . 235
Reduction . . . . . . . . . . . . . . . 239
Rice's Theorem . . . . . . . . . . . . 245
Undecidable Problems About CFLs . 249
Other Formalisms 256
The .X-Calculus . . . . . 262

While Programs . . . . 269
Beyond Undecidability . 274

Godel's Incompleteness Theorem 282
Proof of the Incompleteness Theorem 287

Godel's Proof . . . . . . . . . . . . . . 292

Exercises


299

Homework Sets


Homework 1


301

Homework 2


302

Contents xiii

Miscellaneous Exercises

Finite Automata and Regular Sets ......... . Pushdown Automata and Context-Free Languages . Turing Machines and Effective Computability

Hints and Solutions

Hints for Selected Miscellaneous Exercises . Solutions to Selected Miscellaneous Exercises .

References

Notation and Abbreviations

Polecaj historie

Automata and Computability 9781461218449, 1461218446

This textbook provides undergraduate students with an introduction to the basic theoretical models of computability, and

1,386 96 4MB Read more

Automata and Computability 9781461218449, 1461218446

This textbook provides undergraduate students with an introduction to the basic theoretical models of computability, and

806 102 22MB Read more

Automata, Computability and Complexity: Theory and Applications 0132288060, 9780132288064

The theoretical underpinnings of computing form a standard part of almost every computer science curriculum. But the cla

944 227 202MB Read more

Automata and Computability: A Programmer’s Perspective [Hardcover ed.] 1138552429, 9781138552425

This class-tested textbook provides a comprehensive and accessible introduction to the theory of automata and computatio

1,980 196 18MB Read more

Automata, Computability and Complexity: Theory and Applications 9780132288064, 0132288060, 9780132346177, 0132346176

For upper level courses on Automata. Combining classic theory with unique applications, this crisp narrative is suppor

903 99 7MB Read more

Notes on formal languages, automata, computability, and complexity [draft ed.]

702 171 2MB Read more

Automata and computability: a programmer's perspective 9781315148175, 131514817X, 9781351374279, 1351374273, 9781351374286, 1351374281, 9781351374293, 135137429X

« Automata and Computability is a class-tested textbook which provides a comprehensive and accessible introduction to th

1,110 52 25MB Read more

Automata and Computability (Undergraduate Texts in Computer Science) [Softcover reprint of the original 1st ed. 1997] 1461273099, 9781461273097

This textbook provides undergraduate students with an introduction to the basic theoretical models of computability, and

486 123 22MB Read more

Automata, Dynamical Systems, and Groups

This paper is devoted to the groups of finite automata and their applications in algebra, dynamical systems, and geometr

366 19 903KB Read more

Automata Studies 0691079161

182 91 14MB Read more