3 citations found. Retrieving documents...
P. Rossmanith and W. Rytter. Observations on log n time parallel recognition of unambiguous context-free languages. Information Processing Letters, 44:267--272, 1992.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Making Nondeterminism Unambiguous - Reinhardt, Allender (1997)   (5 citations)  (Correct)

....= true, then exit the for loop. endfor If BAD.CIRCUIT = false then if the output gate g evaluates to 1, then it has a unique minimal weight certificate of some weight l. Accept if and only if W (g) 6= 1 Figure 6: Evaluating a circuit. 4 Discussion and Open Problems Rytter [Ryt87] see also [RR92] showed that any unambiguous context free language can be recognized in logarithmic time by CREW PRAM. In contrast, no such CREW algorithm is known for any problem complete for NL, even in the nonuniform setting. The problem is that, although NL is the class of languages reducible to linear ....

P. Rossmanith and W. Rytter. Observations on log n time parallel recognition of unambiguous context-free languages. Information Processing Letters, 44:267--272, 1992.


Making Nondeterminism Unambiguous - Reinhardt, Allender (1998)   (5 citations)  (Correct)

....true, then exit the for loop. endfor If BAD.CIRCUIT = false then the output gate g evaluates to 1 if and only if W (g) 1. Figure 6: Evaluating a circuit. computation paths. Corollary 3.4 LogCFL poly = UAuxPDA(log n; n O(1) poly. 4 Discussion and Open Problems Rytter [Ryt87] see also [RR92] showed that any unambiguous context free language can be recognized in logarithmic time by a CREW PRAM. In contrast, no such CREW algorithm is known for any problem complete for NL, even in the nonuniform setting, although one might initially suspect that our results, combined with those of ....

P. Rossmanith and W. Rytter. Observations on log n time parallel recognition of unambiguous context-free languages. Information Processing Letters, 44:267--272, 1992.


Making Nondeterminism Unambiguous - Reinhardt, Allender (1997)   (5 citations)  (Correct)

No context found.

P. Rossmanith and W. Rytter. Observations on log n time parallel recognition of unambiguous context-free languages. Information Processing Letters, 44:267--272, 1992.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC