LEADER 01169nam--2200385---450- 001 990000717120203316 005 20051128133525.0 035 $a0071712 035 $aUSA010071712 035 $a(ALEPH)000071712USA01 035 $a0071712 100 $a20011105d1984----km-y0itay0103----ba 101 $aita 102 $aIT 105 $a||||||||001yy 200 1 $aUsi e costumi del Cilento$fEmilio La Greca, Amedeo La Greca, Antonio Di Rienzo 210 $aAcciaroli$cCI.RI., Cilento$d1984 215 $a102 p$d23 cm 676 $a390.094574 700 1$aLA GRECA,$bEmilio$0549376 701 1 $aLA GRECA,$bAmedeo$0549165 701 1a$aDI RIENZO,$bAntonio$0549377 801 0$aIT$bsalbc$gISBD 912 $a990000717120203316 951 $aXV.1.A. 880(V G 840)$b133004 LM$cV G 959 $aBK 969 $aLOCALE 979 $aPATTY$b90$c20011105$lUSA01$h1401 979 $aPATTY$b90$c20011105$lUSA01$h1404 979 $aPATTY$b90$c20011112$lUSA01$h1259 979 $c20020403$lUSA01$h1720 979 $aPATRY$b90$c20040406$lUSA01$h1649 979 $aCOPAT1$b90$c20051128$lUSA01$h1335 996 $aUsi e costumi del Cilento$9962896 997 $aUNISA LEADER 01044nam2 22002771i 450 001 RML0290930 005 20231121125736.0 100 $a20121121d1970 ||||0itac50 ba 101 | $aita 102 $ait 181 1$6z01$ai $bxxxe 182 1$6z01$an 200 1 $aVol. 1.$e: libri 1-4$fPietro Giannone$ga cura di Antonio Marongiu 210 $aMilano $cMarzorati $d1970 215 $a394 p.$d22 cm. 461 1$1001RML0290929$12001 $aIstoria civile del Regno di Napoli$fPietro Giannone$ga cura di Antonio Marongiu 700 1$aGiannone$b, Pietro$f <1676-1748>$3RMLV188083$0299395 702 1$aMarongiu$b, Antonio$3RMLV163931 801 3$aIT$bIT-01$c20121121 850 $aIT-FR0017 899 $aBiblioteca umanistica Giorgio Aprea$bFR0017 912 $aRML0290930 950 2$aBiblioteca umanistica Giorgio Aprea$d 52CIS 10/31.1$e 52VM 0000603945 VM barcode:00059373. - Inventario:5333 MAGVM$fA $h20060329$i20121204 977 $a 52 996 $aVol. 1$93628061 997 $aUNICAS LEADER 05018nam 22006615 450 001 9910962009003321 005 20250801073358.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 /$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 08$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 andRegular 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 $aComputer science 606 $aAlgorithms 606 $aTheory of Computation 606 $aAlgorithms 615 0$aComputer science. 615 0$aAlgorithms. 615 14$aTheory of Computation. 615 24$aAlgorithms. 676 $a511.3 700 $aKozen$b Dexter C$4aut$4http://id.loc.gov/vocabulary/relators/aut$065955 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910962009003321 996 $aAutomata and computability$9374080 997 $aUNINA