EUR 36,89
  • Tous les prix incluent la TVA.
Il ne reste plus que 2 exemplaire(s) en stock (d'autres exemplaires sont en cours d'acheminement).
Expédié et vendu par Amazon. Emballage cadeau disponible.
Quantité :1
AUTOMATA AND COMPUTABILIT... a été ajouté à votre Panier
Vous l'avez déjà ?
Repliez vers l'arrière Repliez vers l'avant
Ecoutez Lecture en cours... Interrompu   Vous écoutez un extrait de l'édition audio Audible
En savoir plus
Voir les 3 images

AUTOMATA AND COMPUTABILITY (Anglais) Relié – 30 juin 1997

Voir les formats et éditions Masquer les autres formats et éditions
Prix Amazon
Neuf à partir de Occasion à partir de
"Veuillez réessayer"
EUR 36,89
EUR 36,89 EUR 63,98

nouveautés livres nouveautés livres

Offres spéciales et liens associés

Descriptions du produit

Automata and Computability 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. Full description

Aucun appareil Kindle n'est requis. Téléchargez l'une des applis Kindle gratuites et commencez à lire les livres Kindle sur votre smartphone, tablette ou ordinateur.

  • Apple
  • Android
  • Windows Phone
  • Android

Pour obtenir l'appli gratuite, saisissez votre adresse e-mail ou numéro de téléphone mobile.

Détails sur le produit

Dans ce livre

(En savoir plus)
Parcourir les pages échantillon
Couverture | Copyright | Table des matières | Extrait | Index | Quatrième de couverture
Rechercher dans ce livre:

Commentaires en ligne

Il n'y a pas encore de commentaires clients sur
5 étoiles
4 étoiles
3 étoiles
2 étoiles
1 étoiles

Commentaires client les plus utiles sur (beta) HASH(0x9dc07984) étoiles sur 5 13 commentaires
18 internautes sur 18 ont trouvé ce commentaire utile 
HASH(0x9dc0815c) étoiles sur 5 Definitely an excellent book 5 février 2002
Par G. Avvinti - Publié sur
Format: Relié
This book has been a great surprise to me. Initially I thought that in about 300 pages (excluding homeworks and exercises) I could not find all I could need for an Automata, Languages and Computation course. I was wrong, definitely. The book is coincise, but also rich and precise.
The material is very well chosen, and the writing stile is directly thought with students in mind. Kozen has a pluri-annual experience in teaching at Cornell University, and it seems he has developed an effective style of communication with students, that's perfectly reflected in his books.
Some important topics are present in this book and not in both Sipser and Hopcroft-Ullman. If you need (as I did) to learn about Myhill-Nerode Relations and Theorem, this book features the best account I've seen (the other, much shorter, reference can be found in the first editon of Hopcroft-Ullman but not in the second one !).
A nice shot of the Lambda-calculus is also featured, and this too lacks in the other two books.
The organization in lectures is a very good idea when studying. Lectures are carefully cut and self-contained, so that you can organize your time using this unit, and wherever you choose to stop a study session, you always stop at correct boundary of a topics.
As a further (and important) note, the notation used is very clear and elegant. As soon as you get used with it (very soon since its clarity) it becomes very stimulating. Don't understimate this value, since many books feature too-hard-to-follow notations, or no notation at all. Both of which cases are to be avoided, INMH.
I have used other books for my course, starting from both the editions of the Hopcroft and Ullman, but one way or the other I found myself always with this book (and Sipser's) in my hands.
10 internautes sur 10 ont trouvé ce commentaire utile 
HASH(0x9ec8a540) étoiles sur 5 Very good as a textbook 4 avril 2003
Par Jeffery Zhang - Publié sur
Format: Relié
This is the textbook I used for my Honors Introduction to Theory of Computing course which was taught by Kozen. This book is very well organized, each chapter corresponds exactly to one lecture, so it's almost like a collection of lecture notes in a sense. This book (and the course it's based on) provides a very good introduction to general theoretical aspects of computing. It's divided mainly into 3 sections, each covering a third of the course. First Finite Automata, then Context Free Languages and Pushdown Automata, finally Turing machines and general computability. It covers the basics very well, sprinkled with some optional lectures on more advanced topics such as Kleene Algebra (which is a favorite of Kozen)
This course mainly deals with notions and models of computation, a previous reviewer noted that it doesn't include NP-completeness. There is a reason for this, because at Cornell University, this course is the first in a sequence, the second of which covers algorithms and complexity issues. That course covers NP-completeness and all the basic algorithm techniques.
For those readers in a similar situation as the previous reviewer, it's difficult to find a more simple introduction to computer theory. I thought DFAs were the easiest part of the book/course, DFAs are the simplest models of computation, you can think of counting fingers as a form of DFA. I'm confident that anyone that can count will be able to understand the explanations of DFA in this book.
9 internautes sur 10 ont trouvé ce commentaire utile 
HASH(0x9ec8a720) étoiles sur 5 Clear and Concise 4 décembre 2000
Par Un client - Publié sur
Format: Relié
This book is an excellent introduction to the subject. There is also material that can be taught to students more advanced than the beginning undergraduate. We used this book for one half (roughly) of a first-year grad course on foundations of computer science.
The greatest strengths of the book are (1) its exceptionally clear writing. (2) Excellent collection of problems (with hints and solutions to a subset of these).
This book follows the "standard" approach to the introduction of notion of effective computability in present day CS curriculum, namely the Turing Machine and formal grammars approach. There is however, thankfully, some introductory material on other formalisms like lamda calculus etc.
One topic whose omission is striking is NP Completeness. It is kind of dissappointing to find a treatment of that subject missing from this wonderful text. I really find it hard to believe that Kozen does not deal with this topic in his under grad class. Considering he has a chapter on something as profound and complicated as Godel's Incompleteness Theorem (and its proof), the omission of NPC is inexplicable. (which is why I give it only 4 stars). Personally, I would have liked to see a good discussion of the Post's Correspondence problem too.
In our class, we kept going back to Sipser's book on this subject, which is an outstanding book in its own right - having the best qualities of Kozen's book and The Book by Hofcroft & Ullman, for more advanced material.
All in all, I think this is a great book for its intended audience.
7 internautes sur 7 ont trouvé ce commentaire utile 
HASH(0x9ec8a69c) étoiles sur 5 An absolute choice to learn automata theory 26 juillet 1999
Par Un client - Publié sur
Format: Relié
The presentation is in an exceptional style of self contained lectures instead of chapters. Apart from the basic lectures, 11 supplementary lectures that cover special topics in the subject and several exercises make the book an IDEAL TEXT. I feel this recently published text is an excellent and an absolute choice to learn automata theory bit by bit, lecture by lecture!
6 internautes sur 6 ont trouvé ce commentaire utile 
HASH(0x9ec8a84c) étoiles sur 5 A canonical text of theoretical CS 18 mars 2000
Par Jonathan Wolfson - Publié sur
Format: Relié
Written with an audience of one class in mind, Professor Kozen writes a book which should be read by a much larger audience-namely, by anyone looking for a solid intoduction to the foundational aspects of theoretical computer science. The order in which the material is presented is perhaps the greatest strength of this text. Kozen starts with a treatment of Finite Automata, then makes a transition into Context Free Grammars, and finally to Turing Machines and a general exploration of computational undecidability. One weakness was that there was little in the way of applications. I think that the greatest understanding of how grammars and TM's work comes from actually using these structures in computer programs. A new edition of the book would benefit greatly from more programming assignments as well as a few chapters discussing areas of where these different machines are actually utilized and how they are so efficient.
Ces commentaires ont-ils été utiles ? Dites-le-nous


Souhaitez-vous compléter ou améliorer les informations sur ce produit ? Ou faire modifier les images?