NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Collections About News Help Login

Press Enter or click the Search button to begin your search.

Back to Results
Comparing complexity classes of formal languagesA 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.
Document ID
19730003454
Acquisition Source
Legacy CDMS
Document Type
Contractor Report (CR)
Authors
Book, R. V. (Harvard Univ. Cambridge, MA, United States)
Date Acquired
September 2, 2013
Publication Date
September 25, 1972
Subject Category
Computers
Report/Patent Number
REPT-19-72
NASA-CR-129294
Report Number: REPT-19-72
Report Number: NASA-CR-129294
Accession Number
73N12181
Funding Number(s)
CONTRACT_GRANT: NSF GJ-30409
CONTRACT_GRANT: NGR-22-007-176
Distribution Limits
Public
Copyright
Work of the US Gov. Public Use Permitted.

Related Records

There are no records associated with this record.
No Preview Available