On the complexity of parallel parsing of general context-free languages (Q1095675)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of parallel parsing of general context-free languages |
scientific article; zbMATH DE number 4028937
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of parallel parsing of general context-free languages |
scientific article; zbMATH DE number 4028937 |
Statements
On the complexity of parallel parsing of general context-free languages (English)
0 references
1986
0 references
Let 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)=\Omega (\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.
0 references
context-free languages
0 references
parallel random-access machine
0 references
parsing tree
0 references
transitive closure of directed graphs
0 references
