Abstract
We present a simple parallel algorithm recognizing unambiguous context-free languages on a CREW PRAM in time log 2 n with only n 3 processors. This gives the smallest number of processors known for the recognition of unambiguous context-free languages in polylogarithmic time. Using the same framework a new algorithm is also given for the recognition of deterministic context-free languages in log 2 n time with quadratic number of processors.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call