{"title":"确定性节能灯并行时间O(log N)接受度","authors":"P. Klein, J. Reif","doi":"10.1137/0217027","DOIUrl":null,"url":null,"abstract":"We give a parallel RAM algorithm for simulating a deterministic auxiliary pushdown machine. If the pushdown machine uses space s(n) ≥ log n and time 2O(s(n)) then our parallel simulation algorithm takes time O(s(n)) and requires 2 processors. Thus any deterministic context free language is accepted in time O(log n) by our parallel RAM algorithm using a polynomial number of processors. (Our algorithm can easily be extended to also accept the LR(k) languages in time O(log n) and 2O(k) Processors. Our simulation algorithm is near optimal for parallel RAMs, since we show that the language accepted in time T(n) by a parallel RAM is accepted by a deterministic auxiliary pushdown machine with space T(n) and time 2O(T(n)2).","PeriodicalId":127919,"journal":{"name":"23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1982-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"25","resultStr":"{\"title\":\"Parallel time O(log N) acceptance of deterministic CFLs\",\"authors\":\"P. Klein, J. Reif\",\"doi\":\"10.1137/0217027\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We give a parallel RAM algorithm for simulating a deterministic auxiliary pushdown machine. If the pushdown machine uses space s(n) ≥ log n and time 2O(s(n)) then our parallel simulation algorithm takes time O(s(n)) and requires 2 processors. Thus any deterministic context free language is accepted in time O(log n) by our parallel RAM algorithm using a polynomial number of processors. (Our algorithm can easily be extended to also accept the LR(k) languages in time O(log n) and 2O(k) Processors. Our simulation algorithm is near optimal for parallel RAMs, since we show that the language accepted in time T(n) by a parallel RAM is accepted by a deterministic auxiliary pushdown machine with space T(n) and time 2O(T(n)2).\",\"PeriodicalId\":127919,\"journal\":{\"name\":\"23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1982-11-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"25\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1137/0217027\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1137/0217027","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Parallel time O(log N) acceptance of deterministic CFLs
We give a parallel RAM algorithm for simulating a deterministic auxiliary pushdown machine. If the pushdown machine uses space s(n) ≥ log n and time 2O(s(n)) then our parallel simulation algorithm takes time O(s(n)) and requires 2 processors. Thus any deterministic context free language is accepted in time O(log n) by our parallel RAM algorithm using a polynomial number of processors. (Our algorithm can easily be extended to also accept the LR(k) languages in time O(log n) and 2O(k) Processors. Our simulation algorithm is near optimal for parallel RAMs, since we show that the language accepted in time T(n) by a parallel RAM is accepted by a deterministic auxiliary pushdown machine with space T(n) and time 2O(T(n)2).
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
