Abstract
We prove that every unambiguous context-free language can be recognized in O(log n) time on a parallel random access machine (P-RAM). This strengthens the result of Reif [2], who has proved that every deterministic context-free language can be recognized in O(log n) time on a P-RAM.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Fortune,S.and J.Wyllie. Parallelism in random access machines. Proceedings of the 10th ACM Symposium on Theory of Computation, pp.114–118 (1978)
Reif J. Parallel time O(log n) acceptance of deterministic cfl's 23 IEEE Symposium on Foundations of Computer Science,pp.290–296(1982)
Ruzzo, W.L. Tree-size bounded alternation. Journal of Computer and System Sciences 21,pp.218–235 (1980)
Rytter,W. Time complexity of two way pushdown automata and recursive programs. NATO Advanced Research Workshop,Combinatorial algorithms on words, (ed.A.Apostolico,Z.Galil) (1984), to appear in Springer-Verlag.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rytter, W. (1985). Parallel time O(log N) recognition of unambiguous CFLs. In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1985. Lecture Notes in Computer Science, vol 199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028822
Download citation
DOI: https://doi.org/10.1007/BFb0028822
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15689-5
Online ISBN: 978-3-540-39636-9
eBook Packages: Springer Book Archive