| Softcover ISBN: | 978-0-8218-1663-9 |
| Product Code: | CBMS/13 |
| List Price: | $26.00 |
| Individual Price: | $20.80 |
| Electronic ISBN: | 978-1-4704-2373-5 |
| Product Code: | CBMS/13.E |
| List Price: | $24.00 |
| Individual Price: | $19.20 |
-
Book DetailsCBMS Regional Conference Series in MathematicsVolume: 13; 1972; 22 ppMSC: Primary 94;
This volume is an outgrowth of a series of lectures presented at the CBMS Regional Conference held at Morehouse College, Atlanta, Georgia, on September 8–12, 1969. The purpose of these notes, which present results reported here for the first time, is twofold. First, to give a quick overview of certain aspects of the mathematical theory of automata and to prove in detail a number of deeper results in this subject. Second, to combine and utilize the various methods, chiefly the method of automata on infinite trees, to obtain a simple and transparent solution of Church's solvability problem.
Readership -
Table of Contents
-
Chapters
-
Automata on infinite objects and Church’s problem
-
Basic definitions and results
-
Closure properties of definable sets
-
The sequential calculus
-
Automaton transformations and Church’s problem
-
Regular trees
-
Definable sets contain regular trees
-
The emptiness problem
-
The solvability problem
-
A basis theorem
-
-
RequestsReview Copy – for reviewers who would like to review an AMS bookAccessibility – to request an alternate format of an AMS title
- Book Details
- Table of Contents
- Requests
This volume is an outgrowth of a series of lectures presented at the CBMS Regional Conference held at Morehouse College, Atlanta, Georgia, on September 8–12, 1969. The purpose of these notes, which present results reported here for the first time, is twofold. First, to give a quick overview of certain aspects of the mathematical theory of automata and to prove in detail a number of deeper results in this subject. Second, to combine and utilize the various methods, chiefly the method of automata on infinite trees, to obtain a simple and transparent solution of Church's solvability problem.
-
Chapters
-
Automata on infinite objects and Church’s problem
-
Basic definitions and results
-
Closure properties of definable sets
-
The sequential calculus
-
Automaton transformations and Church’s problem
-
Regular trees
-
Definable sets contain regular trees
-
The emptiness problem
-
The solvability problem
-
A basis theorem
