Parallel time O(log n) recognition of unambiguous CFLs

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.

[1]  Wojciech Rytter,et al.  The Complexity of Two-Way Pushdown Automata and Recursive Programs , 1985 .

[2]  Steven Fortune,et al.  Parallelism in random access machines , 1978, STOC.

[3]  John H. Reif,et al.  Parallel time O(log N) acceptance of deterministic CFLs , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[4]  Walter L. Ruzzo,et al.  Tree-size bounded alternation(Extended Abstract) , 1979, J. Comput. Syst. Sci..