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 the normal view instead:
scientific article; zbMATH DE number 1189932
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8744603991508484
0 references
0.845058262348175
0 references
0.8382329344749451
0 references
0.8326931595802307
0 references
