Almost optimal sublinear time parallel recognition algorithms for three subclasses of context free languages (Q1128670)
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: Almost optimal sublinear time parallel recognition algorithms for three subclasses of context free languages |
scientific article; zbMATH DE number 1189932
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Almost optimal sublinear time parallel recognition algorithms for three subclasses of context free languages |
scientific article; zbMATH DE number 1189932 |
Statements
Almost optimal sublinear time parallel recognition algorithms for three subclasses of context free languages (English)
0 references
13 August 1998
0 references
parallel computations
0 references
sublinear time
0 references
context-free languages
0 references
