The equivalence of boundary and confluent graph grammars on graph languages of bounded degree (Q5055770)
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 7631177
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The equivalence of boundary and confluent graph grammars on graph languages of bounded degree |
scientific article; zbMATH DE number 7631177 |
Statements
The equivalence of boundary and confluent graph grammars on graph languages of bounded degree (English)
0 references
9 December 2022
0 references
0 references
0.8268929123878479
0 references
0.8192998766899109
0 references
0.8180984854698181
0 references
