Elements of the Theory of Computation

Prentice-Hall (1998)
  Copy   BIBTEX

Abstract

Offering an introduction to algorithms, this work considers automata in the context of their applications, NP-completeness, Turing machine notation and Chomsky normal form.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,031

External links

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

Through your library

Analytics

Added to PP
2015-02-13

Downloads
9 (#1,280,687)

6 months
7 (#491,733)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references