Nested semantics over finite trees are equationally hard (invited talk) (Q2847402)
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: Nested semantics over finite trees are equationally hard (invited talk) |
scientific article; zbMATH DE number 6207114
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nested semantics over finite trees are equationally hard (invited talk) |
scientific article; zbMATH DE number 6207114 |
Statements
9 September 2013
0 references
0 references
0.86847585
0 references
0.85370505
0 references
0.85349005
0 references
Nested semantics over finite trees are equationally hard (invited talk) (English)
0 references
