{"title":"不确定性与双向有限自动机的大小","authors":"W. Sakoda, M. Sipser","doi":"10.1145/800133.804357","DOIUrl":null,"url":null,"abstract":"An important goal of the theory of computation is the classification of languages according to computational difficulty. Classes such as P, NP, and LOGSPACE provide a natural framework for this, though it is a fundamental open problem to demonstrate languages distinguishing them. The complete languages of Cook, Karp, and others [1-7] are candidates for such languages in the sense that, if the classes are in fact different, these languages witness the difference. We consider two questions on regular languages resembling these open problems. One of these questions concerns 2-way non-deterministic (2n) and 2-way deterministic (2d) finite automata:","PeriodicalId":313820,"journal":{"name":"Proceedings of the tenth annual ACM symposium on Theory of computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1978-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"166","resultStr":"{\"title\":\"Nondeterminism and the size of two way finite automata\",\"authors\":\"W. Sakoda, M. Sipser\",\"doi\":\"10.1145/800133.804357\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An important goal of the theory of computation is the classification of languages according to computational difficulty. Classes such as P, NP, and LOGSPACE provide a natural framework for this, though it is a fundamental open problem to demonstrate languages distinguishing them. The complete languages of Cook, Karp, and others [1-7] are candidates for such languages in the sense that, if the classes are in fact different, these languages witness the difference. We consider two questions on regular languages resembling these open problems. One of these questions concerns 2-way non-deterministic (2n) and 2-way deterministic (2d) finite automata:\",\"PeriodicalId\":313820,\"journal\":{\"name\":\"Proceedings of the tenth annual ACM symposium on Theory of computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1978-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"166\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the tenth annual ACM symposium on Theory of computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800133.804357\",\"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 tenth annual ACM symposium on Theory of computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800133.804357","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Nondeterminism and the size of two way finite automata
An important goal of the theory of computation is the classification of languages according to computational difficulty. Classes such as P, NP, and LOGSPACE provide a natural framework for this, though it is a fundamental open problem to demonstrate languages distinguishing them. The complete languages of Cook, Karp, and others [1-7] are candidates for such languages in the sense that, if the classes are in fact different, these languages witness the difference. We consider two questions on regular languages resembling these open problems. One of these questions concerns 2-way non-deterministic (2n) and 2-way deterministic (2d) finite automata: