Fast recognition of deterministic cfl's with a smaller number of processors (Q685360)
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: Fast recognition of deterministic cfl's with a smaller number of processors |
scientific article; zbMATH DE number 417319
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast recognition of deterministic cfl's with a smaller number of processors |
scientific article; zbMATH DE number 417319 |
Statements
Fast recognition of deterministic cfl's with a smaller number of processors (English)
0 references
17 October 1993
0 references
deterministic context-free languages
0 references
deterministic pushdown automata
0 references
logarithmic time
0 references
CREW PRAM
0 references
0 references
0.8361257910728455
0 references
0.8216696977615356
0 references
0.8109115958213806
0 references
