LEADER 01192cam2 22003131 450 001 SOBE00039782 005 20140210115122.0 100 $a20140131d1940 |||||ita|0103 ba 101 $afre$alat 102 $aFR 200 1 $a<<7:>>Trinummus$aTruculentus$aVidularia$aFragmenta$fPlaute$gtexte établi et traduit par Alfred Ernout 210 $aParis$cLes belles lettres$d1940 215 $a203 p. (16-165 doppie)$d20 cm 300 $aTesto originale a fronte 461 1$1001SOBE00039780$12001 $aComédies / Plaute 700 1$aPlautus$b, Titus Maccius$3A600200032000$4070$0166580 702 1$aErnout, Alfred$3A600200032749$4070 801 0$aIT$bUNISOB$c20140210$gRICA 850 $aUNISOB 852 $aUNISOB$j3|C$m11491|ort 912 $aSOBE00039782 940 $aM 102 Monografia moderna SBN 941 $aM 957 $xFondo|Ortolani$a3|C$b031$i-48.2$fmodalitŕ di consultazione sulla home page della Biblioteca link Fondi$gNO$d11491|ort$hOrtolaniS$rdono$1calvano123$2UNISOB$3UNISOB$420140131103535.0$520140131103706.0$6calvano123 996 $aVidularia$919617 996 $aTruculentus$918498 996 $aTrinummus$923016 996 $aFragmenta$926058 997 $aUNISOB LEADER 05198nam 22006255 450 001 9910480043703321 005 20200701172809.0 010 $a1-4612-7309-9 010 $a1-4612-1844-6 024 7 $a10.1007/978-1-4612-1844-9 035 $a(CKB)3400000000089727 035 $a(SSID)ssj0000933620 035 $a(PQKBManifestationID)11512124 035 $a(PQKBTitleCode)TC0000933620 035 $a(PQKBWorkID)10890955 035 $a(PQKB)10325315 035 $a(SSID)ssj0000805235 035 $a(PQKBManifestationID)12307729 035 $a(PQKBTitleCode)TC0000805235 035 $a(PQKBWorkID)10822263 035 $a(PQKB)20783653 035 $a(DE-He213)978-1-4612-1844-9 035 $a(MiAaPQ)EBC3076071 035 $a(EXLCZ)993400000000089727 100 $a20121227d1997 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAutomata and Computability$b[electronic resource] /$fby Dexter C. Kozen 205 $a1st ed. 1997. 210 1$aNew York, NY :$cSpringer New York :$cImprint: Springer,$d1997. 215 $a1 online resource (XIII, 400 p.) 225 1 $aUndergraduate Texts in Computer Science 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a0-387-94907-0 320 $aIncludes bibliographical references and index. 327 $aLectures -- 1 Course Roadmap and Historical Perspective -- 2 Strings and Sets -- 3 Finite Automata and Regular Sets -- 4 More on Regular Sets -- 5 Nondeterministic Finite Automata -- 6 The Subset Construction -- 7 Pattern Matching -- 8 Pattern Matching and Regular Expressions -- 9 Regular Expressions and Finite Automata -- A Kleene Algebra and Regular Expressions -- 10 Homomorphisms -- 11 Limitations of Finite Automata -- 12 Using the Pumping Lemma -- 13 DFA State Minimization -- 14 A Minimization Algorithm -- 15 Myhill?Nerode Relations -- 16 The Myhill?Nerode Theorem -- B Collapsing Nondeterministic Automata -- C Automata on Terms -- D The Myhill?Nerode Theorem for Term Automata -- 17 Two-Way Finite Automata -- 18 2DFAs and Regular Sets -- 19 Context-Free Grammars and Languages -- 20 Balanced Parentheses -- 21 Normal Forms -- 22 The Pumping Lemma for CFLs -- 23 Pushdown Automata -- E Final State Versus Empty Stack -- 24 PDAs and CFGs -- 25 Simulating NPDAs by CFGs -- F Deterministic Pushdown Automata -- 26 Parsing -- 27 The Cocke?Kasami?Younger Algorithm -- G The Chomsky?Schützenberger Theorem -- H Parikh?s Theorem -- 28 Turing Machines and Effective Computability -- 29 More on Turing Machines -- 30 Equivalent Models -- 31 Universal Machines and Diagonalization -- 32 Decidable and Undecidable Problems -- 33 Reduction -- 34 Rice?s Theorem -- 35 Undecidable Problems About CFLs -- 36 Other Formalisms -- 37 The a-Calculus -- I While Programs -- J Beyond Undecidability -- 38 Gödel?s Incompleteness Theorem -- 39 Proof of the Incompleteness Theorem -- K Gödel?s Proof -- Exercises -- Homework Sets -- Homework 1 -- Homework 2 -- Homework 3 -- Homework 4 -- Homework 5 -- Homework 6 -- Homework 7 -- Homework 8 -- Homework 9 -- Homework 10 -- Homework 11 -- Homework 12 -- Miscellaneous Exercises -- Finite Automata and Regular Sets -- Pushdown Automata and Context-Free Languages -- Turing Machines and Effective Computability -- Hints and Solutions -- Hints for Selected Miscellaneous Exercises -- Solutions to Selected Miscellaneous Exercises -- References -- Notation and Abbreviations. 330 $aThe 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. 410 0$aUndergraduate Texts in Computer Science 606 $aComputers 606 $aAlgorithms 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 615 0$aComputers. 615 0$aAlgorithms. 615 14$aComputation by Abstract Devices. 615 24$aAlgorithm Analysis and Problem Complexity. 676 $a511.3 700 $aKozen$b Dexter C$4aut$4http://id.loc.gov/vocabulary/relators/aut$065955 906 $aBOOK 912 $a9910480043703321 996 $aAutomata and computability$9374080 997 $aUNINA