Loading...
Please wait, while we are loading the content...
Similar Documents
Comparing complexity classes of formal languages
| Content Provider | NASA Technical Reports Server (NTRS) |
|---|---|
| Author | Book, R. V. |
| Copyright Year | 1972 |
| Description | A property of polynomial complete languages is extended in order to better compare various classes of formal languages defined by time- or tape-bounded turing machines. |
| File Size | 958775 |
| Page Count | 9 |
| File Format | |
| Alternate Webpage(s) | http://archive.org/details/NASA_NTRS_Archive_19730003454 |
| Archival Resource Key | ark:/13960/t72v79k99 |
| Language | English |
| Publisher Date | 1972-09-25 |
| Access Restriction | Open |
| Subject Keyword | Polynomials Turing Machines Hierarchies Assembly Language Theorem Proving Ntrs Nasa Technical Reports ServerĀ (ntrs) Nasa Technical Reports Server Aerodynamics Aircraft Aerospace Engineering Aerospace Aeronautic Space Science |
| Content Type | Text |
| Resource Type | Technical Report |