{"title":"一些受限类PDA的空间和时间效率TM仿真","authors":"Oscar H. Ibarra, Sam M. Kim, Louis E. Rosier","doi":"10.1016/S0019-9958(85)80030-9","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper we present some space/time efficient Turing machine algorithms for recognizing some subclasses of DCFLs. In particular, we show that the finite minimal stacking and “simple” strict restricted (a subclass of strict restricted) deterministic pushdown automata (FMS-DPDAs, SSR-DPDAs, respectively) can be simulated by offline Turing machines simultaneously in space <em>S</em>(<em>n</em>) and time <em>n</em><sup>2</sup>/<em>S</em>(<em>n</em>) for any tape function <em>S</em>(<em>n</em>) satisfying log <em>n</em> ⩽ <em>S</em>(<em>n</em>) ⩽ <em>n</em> which is constructable in <em>n</em><sup>2</sup>/<em>S</em>(<em>n</em>) time. Generalizations are then made for the corresponding classes of 2-way DPDAs.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"67 1","pages":"Pages 126-143"},"PeriodicalIF":0.0000,"publicationDate":"1985-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80030-9","citationCount":"0","resultStr":"{\"title\":\"On space and time efficient TM simulations of some restricted classes of PDA's\",\"authors\":\"Oscar H. Ibarra, Sam M. Kim, Louis E. Rosier\",\"doi\":\"10.1016/S0019-9958(85)80030-9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In this paper we present some space/time efficient Turing machine algorithms for recognizing some subclasses of DCFLs. In particular, we show that the finite minimal stacking and “simple” strict restricted (a subclass of strict restricted) deterministic pushdown automata (FMS-DPDAs, SSR-DPDAs, respectively) can be simulated by offline Turing machines simultaneously in space <em>S</em>(<em>n</em>) and time <em>n</em><sup>2</sup>/<em>S</em>(<em>n</em>) for any tape function <em>S</em>(<em>n</em>) satisfying log <em>n</em> ⩽ <em>S</em>(<em>n</em>) ⩽ <em>n</em> which is constructable in <em>n</em><sup>2</sup>/<em>S</em>(<em>n</em>) time. Generalizations are then made for the corresponding classes of 2-way DPDAs.</p></div>\",\"PeriodicalId\":38164,\"journal\":{\"name\":\"信息与控制\",\"volume\":\"67 1\",\"pages\":\"Pages 126-143\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1985-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80030-9\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"信息与控制\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0019995885800309\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"信息与控制","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0019995885800309","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
On space and time efficient TM simulations of some restricted classes of PDA's
In this paper we present some space/time efficient Turing machine algorithms for recognizing some subclasses of DCFLs. In particular, we show that the finite minimal stacking and “simple” strict restricted (a subclass of strict restricted) deterministic pushdown automata (FMS-DPDAs, SSR-DPDAs, respectively) can be simulated by offline Turing machines simultaneously in space S(n) and time n2/S(n) for any tape function S(n) satisfying log n ⩽ S(n) ⩽ n which is constructable in n2/S(n) time. Generalizations are then made for the corresponding classes of 2-way DPDAs.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
