The Resource Automata and computability, Dexter C. Kozen

Automata and computability, Dexter C. Kozen

Label
Automata and computability
Title
Automata and computability
Statement of responsibility
Dexter C. Kozen
Creator
Subject
Language
eng
Member of
Action
committed to retain for EAST
Cataloging source
DLC
http://library.link/vocab/creatorDate
1951-
http://library.link/vocab/creatorName
Kozen, Dexter
Index
index present
LC call number
QA267
LC item number
.K69 1997
Literary form
non fiction
Nature of contents
bibliography
http://library.link/vocab/subjectName
  • Machine theory
  • Computable functions
  • machine Turing
  • langage algébrique
  • automate
  • calculabilité
  • fonction calculable
  • théorie machine
  • Computable functions
  • Machine theory
  • Fundamentele informatica
  • Abstracte automaten
  • Berekenbaarheid
  • Automatentheorie
  • Automates mathématiques, Théorie des.
  • Machines séquentielles, Théorie des.
  • Complexité de calcul (informatique)
  • Turing, Machines de.
  • Kellerautomat
  • Kontextfreie Grammatik
  • Turing-Maschine
  • Berechenbarkeit
  • Endlicher Automat
  • Reguläre Menge
Label
Automata and computability, Dexter C. Kozen
Instantiates
Publication
Bibliography note
Includes bibliographical references (p. [373]-379) and index
Carrier category
volume
Carrier category code
  • nc
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
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-Schutzenberger 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 [lambda]-Calculus -- I. While Programs -- J. Beyond Undecidability -- 38. Godel's Incompleteness Theorem -- 39. Proof of the Incompleteness Theorem -- K. Godel's Proof -- Homework Sets -- Miscellaneous Exercises -- Hints and Solutions
Dimensions
24 cm.
Extent
xiii, 400 pages
Isbn
9780387949079
Isbn Type
(hardcover : alk. paper)
Lccn
96037409
Media category
unmediated
Media MARC source
rdamedia
Media type code
  • n
System control number
  • (OCoLC)35911836
  • (OCoLC)ocm35911836
Label
Automata and computability, Dexter C. Kozen
Publication
Bibliography note
Includes bibliographical references (p. [373]-379) and index
Carrier category
volume
Carrier category code
  • nc
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
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-Schutzenberger 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 [lambda]-Calculus -- I. While Programs -- J. Beyond Undecidability -- 38. Godel's Incompleteness Theorem -- 39. Proof of the Incompleteness Theorem -- K. Godel's Proof -- Homework Sets -- Miscellaneous Exercises -- Hints and Solutions
Dimensions
24 cm.
Extent
xiii, 400 pages
Isbn
9780387949079
Isbn Type
(hardcover : alk. paper)
Lccn
96037409
Media category
unmediated
Media MARC source
rdamedia
Media type code
  • n
System control number
  • (OCoLC)35911836
  • (OCoLC)ocm35911836

Library Locations

  • African Studies LibraryBorrow it
    771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Alumni Medical LibraryBorrow it
    72 East Concord Street, Boston, MA, 02118, US
    42.336388 -71.072393
  • Astronomy LibraryBorrow it
    725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US
    42.350259 -71.105717
  • Fineman and Pappas Law LibrariesBorrow it
    765 Commonwealth Avenue, Boston, MA, 02215, US
    42.350979 -71.107023
  • Frederick S. Pardee Management LibraryBorrow it
    595 Commonwealth Avenue, Boston, MA, 02215, US
    42.349626 -71.099547
  • Howard Gotlieb Archival Research CenterBorrow it
    771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Mugar Memorial LibraryBorrow it
    771 Commonwealth Avenue, Boston, MA, 02215, US
    42.350723 -71.108227
  • Music LibraryBorrow it
    771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Pikering Educational Resources LibraryBorrow it
    2 Silber Way, Boston, MA, 02215, US
    42.349804 -71.101425
  • School of Theology LibraryBorrow it
    745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350494 -71.107235
  • Science & Engineering LibraryBorrow it
    38 Cummington Mall, Boston, MA, 02215, US
    42.348472 -71.102257
  • Stone Science LibraryBorrow it
    675 Commonwealth Avenue, Boston, MA, 02445, US
    42.350103 -71.103784
Processing Feedback ...