Models of computation and formal languages

New York: Oxford University Press (1998)
  Copy   BIBTEX

Abstract

This unique book presents a comprehensive and rigorous treatment of the theory of computability which is introductory yet self-contained. It takes a novel approach by looking at the subject using computation models rather than a limitation orientation, and is the first book of its kind to include software. Accompanying software simulations of almost all computational models are available for use in conjunction with the text, and numerous examples are provided on disk in a user-friendly format. Its applications to computer science itself include interesting links to programming language theory, compiler design theory, and algorithm design. The software, numerous examples, and solutions make this book ideal for self-study by computer scientists and mathematicians alike.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,471

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

What is computation?B. Jack Copeland - 1996 - Synthese 108 (3):335-59.
Computability, complexity, logic.Egon Börger - 1989 - New York, N.Y., U.S.A.: Elsevier Science Pub. Co..
Domains and lambda-calculi.Roberto M. Amadio - 1998 - New York: Cambridge University Press. Edited by P.-L. Curien.
Computable models.Raymond Turner - 2009 - London: Springer.
An introduction to formal logic.Peter Smith - 2003 - New York: Cambridge University Press.
Computation and automata.Arto Salomaa - 1985 - New York: Cambridge University Press.

Analytics

Added to PP
2009-01-28

Downloads
9 (#1,260,789)

6 months
2 (#1,206,545)

Historical graph of downloads
How can I increase my downloads?