Parallel time O(log n) recognition of unambiguous context-free languages (Q1096400): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0890-5401(87)90041-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2085339857 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallelism in random access machines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Tree-size bounded alternation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3700838 / rank | |||
Normal rank | |||
Latest revision as of 13:52, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel time O(log n) recognition of unambiguous context-free languages |
scientific article |
Statements
Parallel time O(log n) recognition of unambiguous context-free languages (English)
0 references
1987
0 references
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 \textit{J. Reif} [Proc. 23rd IEEE Symp. Found. Comput., 114-118 (1982)], who proved that every deterministic context- free language can be recognized on a P-RAM in O(log n) time.
0 references
unambiguous context-free language
0 references
parallel random access machine
0 references
polynomial number of processors
0 references
