Klicka på en bild för att gå till Google Book Search.
Laddar... Automata and Computabilityav Dexter C. Kozen
Ingen/inga Laddar...
Gå med i LibraryThing för att få reda på om du skulle tycka om den här boken. Det finns inga diskussioner på LibraryThing om den här boken. Excellent introductory text on formal language theory, with a bit on the theory of computation at the end which borders on philosophical. ( ) inga recensioner | lägg till en recension
Ingår i serien
The aim of this textbook is to provide undergraduate students with an introduction to the basic theoretical models of computability, and to develop some of the model's rich and varied structure. Students who have already some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts. 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 discussions of effective computability, decidability, and Gödel's incompleteness theorems. Plenty of exercises are provided, ranging from the easy to the challenging. As a result, this text will make an ideal first course for students of computer science. Inga biblioteksbeskrivningar kunde hittas. |
Pågående diskussionerIngen/inga
Google Books — Laddar... GenrerMelvil Decimal System (DDC)511.3Natural sciences and mathematics Mathematics General Principles Mathematical (Symbolic) logicKlassifikation enligt LCBetygMedelbetyg:
Är det här du? |