A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata (Q2830211)
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: A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata |
scientific article; zbMATH DE number 6650026
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata |
scientific article; zbMATH DE number 6650026 |
Statements
A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata (English)
0 references
9 November 2016
0 references
0 references
0.8856818
0 references
0.8600271
0 references
0.85866535
0 references
0.85866535
0 references
0.8583206
0 references
0.8462122
0 references
0.8460486
0 references
0.84018934
0 references
