|
|
|
Item Details
Title:
|
AUTOMATA AND COMPUTABILITY
|
By: |
Dexter Kozen |
Format: |
Paperback |
List price:
|
£54.99 |
We currently do not stock this item, please contact the publisher directly for
further information.
|
|
|
|
|
ISBN 10: |
1461273099 |
ISBN 13: |
9781461273097 |
Publisher: |
SPRINGER-VERLAG NEW YORK INC. |
Pub. date: |
13 October, 2012 |
Edition: |
Softcover reprint of the original 1st ed. 1997 |
Series: |
Undergraduate Texts in Computer Science |
Pages: |
413 |
Description: |
This textbook provides undergraduate students with an introduction to the basic theoretical models of computability. Students who have already some experience with elementary discrete mathematics will find this a well-paced first course. Plenty of exercises are provided, ranging from the easy to the challenging. |
Synopsis: |
This textbook provides undergraduate students with an introduction to the basic theoretical models of computability, and develops some of the model's rich and varied structure. The first part of the book is devoted to finite automata and their properties. Pushdown automata provide a broader class of models and enable the analysis of context-free languages. In the remaining chapters, Turing machines are introduced and the book culminates in analyses of effective computability, decidability, and Godel's incompleteness theorems. Students who already have some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts. |
Illustrations: |
biography |
Publication: |
US |
Imprint: |
Springer-Verlag New York Inc. |
Returns: |
Returnable |
|
|
|
|
Ramadan and Eid al-Fitr
A celebratory, inclusive and educational exploration of Ramadan and Eid al-Fitr for both children that celebrate and children who want to understand and appreciate their peers who do.
|
|
|
|
|
|
|
|
|
|
|