{"title":"关于双向确定性下推自动机功率的两个结果","authors":"Daniel Martin, J. Gwynn","doi":"10.1145/800192.805729","DOIUrl":null,"url":null,"abstract":"It is known that there is no one-way, non-deterministic Pushdown Automaton (INPDA) which is a universal machine for the class of Finite Automata [6]. We will show that there is a two-way, deterministic Pushdown Automaton (2DPDA), U, which is a universal machine for the class of Finite Automata (FA). Our method will parallel Knuth and Bigelow's construction of a language which is not context sensitive but which is the acceptance set of some stack automaton [5], that is, we will construct a language which is not context-free, but which is accepted by a 2DPDA.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Two results concerning the power of two-way deterministic Pushdown Automata\",\"authors\":\"Daniel Martin, J. Gwynn\",\"doi\":\"10.1145/800192.805729\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is known that there is no one-way, non-deterministic Pushdown Automaton (INPDA) which is a universal machine for the class of Finite Automata [6]. We will show that there is a two-way, deterministic Pushdown Automaton (2DPDA), U, which is a universal machine for the class of Finite Automata (FA). Our method will parallel Knuth and Bigelow's construction of a language which is not context sensitive but which is the acceptance set of some stack automaton [5], that is, we will construct a language which is not context-free, but which is accepted by a 2DPDA.\",\"PeriodicalId\":72321,\"journal\":{\"name\":\"ASSETS. Annual ACM Conference on Assistive Technologies\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1973-08-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ASSETS. Annual ACM Conference on Assistive Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800192.805729\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ASSETS. Annual ACM Conference on Assistive Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800192.805729","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Two results concerning the power of two-way deterministic Pushdown Automata
It is known that there is no one-way, non-deterministic Pushdown Automaton (INPDA) which is a universal machine for the class of Finite Automata [6]. We will show that there is a two-way, deterministic Pushdown Automaton (2DPDA), U, which is a universal machine for the class of Finite Automata (FA). Our method will parallel Knuth and Bigelow's construction of a language which is not context sensitive but which is the acceptance set of some stack automaton [5], that is, we will construct a language which is not context-free, but which is accepted by a 2DPDA.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
