An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees (Q3617699)
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 5535565
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees |
scientific article; zbMATH DE number 5535565 |
Statements
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees (English)
0 references
31 March 2009
0 references
0.7266216278076172
0 references
0.7109069228172302
0 references
0.6999428272247314
0 references
