Abstract
The number of processors needed to recognize deterministic cfl's in logarithmic time on a CREW PRAM is reduced to n 2 + ɛ for arbitrarily small 0 < ɛ < 1. A simplified version of the Klein-Reif algorithm is also presented.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
