Computation and Automata

Cambridge University Press (1985)
Abstract
This introduction to certain mathematical topics central to theoretical computer science treats computability and recursive functions, formal languages and automata, computational complexity, and cruptography. The presentation is essentially self-contained with detailed proofs of all statements provided. Although it begins with the basics, it proceeds to some of the most important recent developments in theoretical computer science.
Keywords Computable functions  Computational complexity  Sequential machine theory
Categories (categorize this paper)
Buy the book $11.00 used (95% off)   $52.10 new (73% off)   $88.70 direct from Amazon (5% off)    Amazon page
Call number QA9.59.S25 1985
ISBN(s) 0521177332   0521302455   9780521302456
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,798
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
On the Difficulty of Making Social Choices.Hannu Nurmi - 1995 - Theory and Decision 38 (1):99-119.

Add more citations

Similar books and articles
Added to PP index
2009-01-28

Total downloads
28 ( #189,488 of 2,202,422 )

Recent downloads (6 months)
1 ( #300,203 of 2,202,422 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature