|
|
|
|
| LEADER |
00000cam a2200000 4500 |
| 001 |
EBOOKCENTRAL_ocn959147733 |
| 003 |
OCoLC |
| 005 |
20240329122006.0 |
| 006 |
m o d |
| 007 |
cr |n|---||||| |
| 008 |
160924s1997 nyu o 000 0 eng d |
| 040 |
|
|
|a EBLCP
|b eng
|e pn
|c EBLCP
|d OCLCQ
|d YDX
|d OCLCQ
|d LOA
|d OCLCO
|d OCLCF
|d OCLCO
|d OCLCQ
|d OCLCO
|d OCLCL
|
| 066 |
|
|
|c (S
|
| 019 |
|
|
|a 958525972
|a 968430407
|a 969642822
|
| 020 |
|
|
|a 9781461218449
|
| 020 |
|
|
|a 1461218446
|
| 020 |
|
|
|z 1461273099
|
| 020 |
|
|
|z 9781461273097
|
| 035 |
|
|
|a (OCoLC)959147733
|z (OCoLC)958525972
|z (OCoLC)968430407
|z (OCoLC)969642822
|
| 050 |
|
4 |
|a QA267
|b .K69 1997
|
| 082 |
0 |
4 |
|a 511.3
|2 21
|
| 049 |
|
|
|a UAMI
|
| 100 |
1 |
|
|a Kozen, Dexter C.
|
| 245 |
1 |
0 |
|a Automata and Computability.
|
| 250 |
|
|
|a N.
|
| 260 |
|
|
|a New York :
|b Springer New York,
|c 1997.
|
| 300 |
|
|
|a 1 online resource (406 pages)
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 588 |
0 |
|
|a Print version record.
|
| 505 |
0 |
|
|a UNDERGRADUATE TEXTS IN COMPUTER SCIENCE; Automata and Computability; Copyright; Preface; Contents; Lectures; Lecture 1 Course Roadmap and Historical Perspective; Lecture 2 Strings and Sets; Lecture 3 Finite Automata and Regular Sets; Lecture 4 More on Regular Sets; Lecture 5 Nondeterministic Finite Automata; Lecture 6 The Subset Construction; Lecture 7 Pattern Matching; Lecture 8 Pattern Matching and Regular Expressions; Lecture 9 Regular Expressions and Finite Automata; Supplementary Lecture A Kleene Algebra and Regular Expressions; Lecture 10 Homomorphisms.
|
| 505 |
8 |
|
|a Lecture 11 Limitations of Finite AutomataLecture 12 Using the Pumping Lemma; Lecture 13 DFA State Minimization; Lecture 14 A Minimization Algorithm; Lecture 15 Myhill-Nerode Relations; Lecture 16 The Myhill-Nerode Theorem; Supplementary Lecture B Collapsing Nondeterministic Automata; Supplementary Lecture C Automata on Terms; Supplementary Lecture D The Myhill-Nerode Theorem for Term Automata; Lecture 17 Two-Way Finite Automata; Lecture 18 2DFAs and Regular Sets; Lecture 19 Context-Free Grammars and Languages; Lecture 20 Balanced Parentheses; Lecture 21 Normal Forms.
|
| 505 |
8 |
|
|a Lecture 22 The Pumping Lemma for CFLsLecture 23 Pushdown Automata; Supplementary Lecture E Final State Versus Empty Stack; Lecture 24 PDAs and CFGs; Lecture 25 Simulating NPDAs by CFGs; Supplementary Lecture F Deterministic Pushdown Automata; Lecture 26 Parsing; Lecture 27 The Cocke-Kasami-Younger Algorithm; Supplementary Lecture G The Chomsky-Schützenberger Theorem; Supplementary Lecture H Parikh's Theorem; Lecture 28 Turing Machines and Effective Computability; Lecture 29 More on Turing Machines; Lecture 30 Equivalent Models; Lecture 31 Universal Machines and Diagonalization.
|
| 505 |
8 |
|
|6 880-01
|a Miscellaneous Exercises Turing Machines and Effective ComputabilityHints for Selected Miscellaneous Exercises; Solutions to Selected Miscellaneous Exercises; References; Notation and Abbreviations; Index.
|
| 590 |
|
|
|a ProQuest Ebook Central
|b Ebook Central Academic Complete
|
| 650 |
|
0 |
|a Machine theory.
|
| 650 |
|
0 |
|a Computable functions.
|
| 650 |
|
6 |
|a Théorie des automates.
|
| 650 |
|
6 |
|a Fonctions calculables.
|
| 650 |
|
7 |
|a Computable functions
|2 fast
|
| 650 |
|
7 |
|a Machine theory
|2 fast
|
| 700 |
1 |
|
|a Gries, David.
|
| 700 |
1 |
|
|a Schneider, Fred B.
|
| 758 |
|
|
|i has work:
|a Automata and computability (Text)
|1 https://id.oclc.org/worldcat/entity/E39PCGFYB4FTgQXBP9bGpTFFrq
|4 https://id.oclc.org/worldcat/ontology/hasWork
|
| 776 |
0 |
8 |
|i Print version:
|a Kozen, Dexter C.
|t Automata and Computability.
|d New York : Springer New York, ©1997
|z 9781461273097
|
| 856 |
4 |
0 |
|u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=3076071
|z Texto completo
|
| 880 |
8 |
|
|6 505-01/(S
|a Lecture 32 Decidable and Undecidable ProblemsLecture 33 Reduction; Lecture 34 Rice's Theorem; Lecture 35 Undecidable Problems About CFLs; Lecture 36 Other Formalisms; Lecture 37 The λ-Calculus; Supplementary Lecture I While Programs; Supplementary Lecture J Beyond Undecidability; Lecture 38 Godel's Incompleteness Theorem; Lecture 39 Proof of the Incompleteness Theorem; Supplementary Lecture K Godel's Proof; Exercises; Miscellaneous Exercises Finite Automata and Regular Sets; Miscellaneous Exercises Pushdown Automata and Context-Free Languages.
|
| 936 |
|
|
|a BATCHLOAD
|
| 938 |
|
|
|a ProQuest Ebook Central
|b EBLB
|n EBL3076071
|
| 938 |
|
|
|a YBP Library Services
|b YANK
|n 13338366
|
| 994 |
|
|
|a 92
|b IZTAP
|
