On the Time and Tape Complexity of Languages, I
| dc.contributor.author | Hunt, Harry B., III | en_US |
| dc.date.accessioned | 2007-04-19T19:02:45Z | |
| dc.date.available | 2007-04-19T19:02:45Z | |
| dc.date.issued | 1973-01 | en_US |
| dc.description.abstract | We investigate the relationship between the classes of languages accepted by deterministic and nondeterministic polynomial time bounded Turing machines and the relationship between the classes of languages accepted by deterministic polynomial time bounded and by nondeterministic polynomial tape bounded Turing machines. In both cases we study generators of the nondeterministic class that generate it by operations that the deterministic class is closed under. | en_US |
| dc.format.extent | 2297040 bytes | |
| dc.format.extent | 785975 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR73-156 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6007 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | On the Time and Tape Complexity of Languages, I | en_US |
| dc.type | technical report | en_US |