快速识别下推自动化和上下文无关的语言

Q4 Mathematics 信息与控制 Pub Date : 1985-10-01 DOI:10.1016/S0019-9958(85)80024-3

Wojciech Rytter

{"title":"快速识别下推自动化和上下文无关的语言","authors":"Wojciech Rytter","doi":"10.1016/S0019-9958(85)80024-3","DOIUrl":null,"url":null,"abstract":"<div>We prove: (1) every language accepted by a two-way nondeterministic pushdown automaton can be recognized on a random access machine in O(n3/log n) time; (2) every language accepted by a loop-free two-way nondeterministic pushdown automaton can be recognized in O(n3/log2 n) time; (3) every context-free language can be recognized on-line in O(n3/log2 n) time. We improve the results of Aho, Hopcroft, and Ullman (Inform. Contr. 13, 1968, 186–206), Rytter (Inform. Process. Lett. 16, 1983, 127–129), and Graham, Harrison, and Ruzzo (ACM Trans. Programm. Lang. Systems 2, No. 3, 1980, 415–462).</div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"67 1","pages":"Pages 12-22"},"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)80024-3","citationCount":"44","resultStr":"{\"title\":\"Fast recognition of pushdown automaton and context-free languages\",\"authors\":\"Wojciech Rytter\",\"doi\":\"10.1016/S0019-9958(85)80024-3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>We prove: (1) every language accepted by a two-way nondeterministic pushdown automaton can be recognized on a random access machine in O(n3/log n) time; (2) every language accepted by a loop-free two-way nondeterministic pushdown automaton can be recognized in O(n3/log2 n) time; (3) every context-free language can be recognized on-line in O(n3/log2 n) time. We improve the results of Aho, Hopcroft, and Ullman (Inform. Contr. 13, 1968, 186–206), Rytter (Inform. Process. Lett. 16, 1983, 127–129), and Graham, Harrison, and Ruzzo (ACM Trans. Programm. Lang. Systems 2, No. 3, 1980, 415–462).</div>\",\"PeriodicalId\":38164,\"journal\":{\"name\":\"信息与控制\",\"volume\":\"67 1\",\"pages\":\"Pages 12-22\"},\"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)80024-3\",\"citationCount\":\"44\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"信息与控制\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0019995885800243\",\"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/S0019995885800243","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}

引用次数: 44

摘要

我们证明:(1)在O(n3/log n)时间内，每一种被双向非确定性下推自动机接受的语言都可以在随机存取机上被识别;(2)无回路双向非确定性下推自动机接受的每种语言都能在O(n3/ log2n)时间内被识别;(3)在O(n3/ log2n)的时间内，所有与上下文无关的语言都可以在线识别。我们改进了Aho, Hopcroft和Ullman (Inform)的结果。控制13,1968,186-206)，Rytter(通知。的过程。左16,1983,127-129)，和格雷厄姆，哈里森，和Ruzzo (ACM翻译。programm朗。系统2，第3期，1980,415-462)。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Fast recognition of pushdown automaton and context-free languages

We prove: (1) every language accepted by a two-way nondeterministic pushdown automaton can be recognized on a random access machine in O(n³/log n) time; (2) every language accepted by a loop-free two-way nondeterministic pushdown automaton can be recognized in O(n³/log² n) time; (3) every context-free language can be recognized on-line in O(n³/log² n) time. We improve the results of Aho, Hopcroft, and Ullman (Inform. Contr. 13, 1968, 186–206), Rytter (Inform. Process. Lett. 16, 1983, 127–129), and Graham, Harrison, and Ruzzo (ACM Trans. Programm. Lang. Systems 2, No. 3, 1980, 415–462).