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.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
