599,00 DKK
+ 72,99 DKK Levering

Automata and Computability

  • Brand: Unbranded

Automata and Computability

  • Brand: Unbranded
Pris: 599,00 DKK
Sоlgt af:
599,00 DKK
+ 72,99 DKK Levering

På lager

Vi accepterer følgende betalingsmetoder

Beskrivelse

Lectures. - 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 MyhillNerode Relations. - 16 The MyhillNerode Theorem. - B Collapsing Nondeterministic Automata. - C Automata on Terms. - D The MyhillNerode 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 CockeKasamiYounger Algorithm. - G The ChomskySchü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. Language: English
  • Brand: Unbranded
  • Kategori: Computer og internet
  • Format: Paperback
  • Forlag / Pladeselskab: Springer
  • Udgivelsesdato: 2012/10/13
  • Kunstner: Dexter C. Kozen
  • Sprog: English
  • Antal sider: 400
  • Fruugo ID: 337900960-741560320
  • ISBN: 9781461273097

Levering og returnering

Sendt inden for 4 dage

  • STANDARD: 72,99 DKK - Levering mellem kl tir. 07 oktober 2025–fre. 10 oktober 2025

Afsendes fra Storbritannien.

Vi gør vores bedste for at sikre, at de produkter, du bestiller, leveres til dig fuldt ud og i henhold til dine specifikationer. Skulle du dog modtage en ufuldstændig ordre eller andre ting end dem, du bestilte, eller der er en anden grund til, at du ikke er tilfreds med ordren, kan du returnere ordren eller produkter inkluderet i ordren og modtage en fuld refusion for varerne. Se fuld returpolitik