AbstractLet T(n) be the time to recognize context-free languages on a parallel random-access machine without write conflicts (P-RAM) using a polynomial number of processors. We assume that T(n) = Ω(log n). Let P(n) be the time to compute a representation of a parsing tree for strings of length n using a polynomial number of processors. Then we prove P(n) = O(T(n)).A related result is a parallel time log n computation of the transitive closure of directed graphs having special structure
The Bird-Meertens theory of lists and two theorems by Bird are used to develop associative operators...
A recognition algorithm is exhibited whereby an arbitrary string over a given vocabulary can be test...
A parallel algorithm is presented for recognizing the class of languages generated by tree adjoining...
AbstractLet T(n) be the time to recognize context-free languages on a parallel random-access machine...
AbstractWe prove that every unambiguous context-free language can be recognized in O(log n) time on ...
AbstractWe prove that the parsing problem for bracket context-free languages can be solved in log n ...
AbstractWe present a simple parallel algorithm recognizing unambiguous context-free languages on a C...
AbstractWe prove that every unambiguous context-free language can be recognized in O(log n) time on ...
AbstractComputing the number of strings of given length contained in a language is related to classi...
A parallel parsing technique is presented in which parentheses are inserted in the string to be pars...
AbstractWe present a simple parallel algorithm recognizing unambiguous context-free languages on a C...
Computing the number of strings of given length contained in a language is related to classical prob...
A parallel algorithm is presented for recognizing the class of languages generated by tree adjoining...
AbstractThe size of an accepting computation tree of an alternating Turing machine (ATM) is introduc...
We present a divide-and-conquer algorithm for parsing context-free languages efficiently. Our algori...
The Bird-Meertens theory of lists and two theorems by Bird are used to develop associative operators...
A recognition algorithm is exhibited whereby an arbitrary string over a given vocabulary can be test...
A parallel algorithm is presented for recognizing the class of languages generated by tree adjoining...
AbstractLet T(n) be the time to recognize context-free languages on a parallel random-access machine...
AbstractWe prove that every unambiguous context-free language can be recognized in O(log n) time on ...
AbstractWe prove that the parsing problem for bracket context-free languages can be solved in log n ...
AbstractWe present a simple parallel algorithm recognizing unambiguous context-free languages on a C...
AbstractWe prove that every unambiguous context-free language can be recognized in O(log n) time on ...
AbstractComputing the number of strings of given length contained in a language is related to classi...
A parallel parsing technique is presented in which parentheses are inserted in the string to be pars...
AbstractWe present a simple parallel algorithm recognizing unambiguous context-free languages on a C...
Computing the number of strings of given length contained in a language is related to classical prob...
A parallel algorithm is presented for recognizing the class of languages generated by tree adjoining...
AbstractThe size of an accepting computation tree of an alternating Turing machine (ATM) is introduc...
We present a divide-and-conquer algorithm for parsing context-free languages efficiently. Our algori...
The Bird-Meertens theory of lists and two theorems by Bird are used to develop associative operators...
A recognition algorithm is exhibited whereby an arbitrary string over a given vocabulary can be test...
A parallel algorithm is presented for recognizing the class of languages generated by tree adjoining...
DOI
Add to ORKG