Fast recognition of deterministic cfl's with a smaller number of processors

AbstractThe number of processors needed to recognize deterministic cfl's in logarithmic time on a CREW PRAM is reduced to n2 + ɛ for arbitrarily small 0 < ɛ < 1. A simplified version of the Klein-Reif algorithm is also presented