Introduction to Automata Theory, Languages, and ComputationAddison-Wesley, 1979 - 418 pages Preliminaries. Finite automata and regular expressions. Properties of regular sets. Context-free grammars. Pushdown automata; Properties of context-free languages. Turing machines. Undecidability. The Cohmsky hierarchy. Heterministic context-free languages. Closure properties of families of languages. Computational complexity theory. Intractable problems. Highlights of other important language classes. |
Avis des internautes - Rédiger un commentaire
Avis des utilisateurs
| 5 étoiles |
| ||
| 4 étoiles |
| ||
| 3 étoiles |
| ||
| 2 étoiles |
| ||
| 1 étoile |
|
Les avis ne sont pas validés, mais Google recherche et supprime les faux contenus lorsqu'ils sont identifiés
LibraryThing Review
Avis d'utilisateur - Foretopman - LibraryThingI need to make it clear right at the beginning that this is a review of the first (1979) edition of this book. It's my understanding that the second edition is better. I knew that this book was going ... Consulter l'avis complet
LibraryThing Review
Avis d'utilisateur - dominus - LibraryThing(This is a review of the first edition of this book.) This is another one of those rotten books that is difficult to read even when you already know the subject matter backward and forward. One of the ... Consulter l'avis complet
Autres éditions - Tout afficher
Expressions et termes fréquents
accepts algorithm alphabet appears applied assume automata begin binary called cells CFL's closed closure complexity computation Consider consists construct contains context-free corresponding crossing defined denote derivation determine deterministic empty enters equivalent Example Exercise exists final finite finite automaton follows formal function give given grammar halts head induction infinite initial input input symbol integers labeled language least Lemma length moves nondeterministic Note operations output pair particular path position problem productions Proof properties prove recursive reduces regular expression regular set relation replaced represented respectively result rule satisfies scanned sequence shown in Fig simulate solution space stack steps string Suppose symbol takes tape terminal Theorem track transition tree true Turing machine undecidable valid variable vertex vertices
Références à ce livre
Informations bibliographiques
| Titre | Introduction to Automata Theory, Languages, and Computation Addison-Wesley Series in Computer Science and Information Processing Addison-Wesley series in computer science |
| Auteurs | John E. Hopcroft, John and Ullman Hopcroft (Jeffrey), Jeffrey D. Ullman |
| Collaborateur | Jeffrey D. Ullman |
| Édition | illustrée |
| Éditeur | Addison-Wesley, 1979 |
| Original provenant de | l'Université du Michigan |
| Numérisé | 20 nov. 2007 |
| ISBN | 020102988X, 9780201029888 |
| Longueur | 418 pages |
| Exporter la citation | BiBTeX EndNote RefMan |