论语言的时间和磁带复杂性

Proceedings of the fifth annual ACM symposium on Theory of computing Pub Date : 1973-04-30 DOI:10.1145/800125.804030

H. Hunt

{"title":"论语言的时间和磁带复杂性","authors":"H. Hunt","doi":"10.1145/800125.804030","DOIUrl":null,"url":null,"abstract":"We investigate the following: (1) the relationship between the classes of languages accepted by deterministic and nondeterministic polynomial time bounded Turing machines; (2) the time and tape complexity of many predicates on the regular sets; (3) the relationship between the classes of languages accepted by deterministic or nondeterministic polynomial time bounded Turing machines and the class of languages accepted by polynomial tape bounded Turing machines; and (4) the complexity of many predicates about stack automata. We find several problems with nonpolynomial lower complexity bounds.","PeriodicalId":242946,"journal":{"name":"Proceedings of the fifth annual ACM symposium on Theory of computing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1973-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"62","resultStr":"{\"title\":\"On the time and tape complexity of languages I\",\"authors\":\"H. Hunt\",\"doi\":\"10.1145/800125.804030\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We investigate the following: (1) the relationship between the classes of languages accepted by deterministic and nondeterministic polynomial time bounded Turing machines; (2) the time and tape complexity of many predicates on the regular sets; (3) the relationship between the classes of languages accepted by deterministic or nondeterministic polynomial time bounded Turing machines and the class of languages accepted by polynomial tape bounded Turing machines; and (4) the complexity of many predicates about stack automata. We find several problems with nonpolynomial lower complexity bounds.\",\"PeriodicalId\":242946,\"journal\":{\"name\":\"Proceedings of the fifth annual ACM symposium on Theory of computing\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1973-04-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"62\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the fifth annual ACM symposium on Theory of computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800125.804030\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the fifth annual ACM symposium on Theory of computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800125.804030","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 62

摘要

我们研究了以下内容:(1)确定性和非确定性多项式时间有界图灵机所接受的语言类别之间的关系;(2)正则集上许多谓词的时间和磁带复杂度;(3)确定性或非确定性多项式时间有界图灵机接受的语言类别与多项式带有界图灵机接受的语言类别之间的关系;(4)堆栈自动机中许多谓词的复杂性。我们发现了几个具有非多项式下复杂度界的问题。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On the time and tape complexity of languages I

We investigate the following: (1) the relationship between the classes of languages accepted by deterministic and nondeterministic polynomial time bounded Turing machines; (2) the time and tape complexity of many predicates on the regular sets; (3) the relationship between the classes of languages accepted by deterministic or nondeterministic polynomial time bounded Turing machines and the class of languages accepted by polynomial tape bounded Turing machines; and (4) the complexity of many predicates about stack automata. We find several problems with nonpolynomial lower complexity bounds.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the fifth annual ACM symposium on Theory of computing

CiteScore

7.80

自引率

0.00%

发文量