Parallel time O(log n) recognition of unambiguous context-free languages

https://doi.org/10.1016/0890-5401(87)90041-1Get rights and content
Under an Elsevier user license
open archive

Abstract

We prove that every unambiguous context-free language can be recognized in O(log n) time on a parallel random access machine without write conflicts (P-RAM) using a polynomial number of processors. This strengthens the result of Reif (1982, in “Proceedings, 23rd IEEE Symp. Found. Comput.,” pp. 114–118), who proved that every deterministic context-free language can be recognized on a P-RAM in O(log n) time.

Cited by (0)

A Preliminary version of this paper was presented at the Conference of Fund. of Comput. Theory, Cottbus, 1985.