Searching for "On the Parallel Recognition of Unambiguous Context-Free Languages." – sorted by Relevance.
-
Observations On Log(n) Time Parallel Recognition Of Unambiguous CFL's
- , unambiguous context free languages 1. Introduction Our model of parallel computations is the CREW PRAM, see
- Cited by 1 (0 self) – Add To MetaCart
-
Almost Optimal Sublinear Time Parallel Recognition Algorithms for Three Subclasses of Context Free
- ]). 2 Parallel recognition of unambiguous context-free languages We use a version of the algorithm
- Cited by 1 (0 self) – Add To MetaCart

