Name
Abstract | ||
|---|---|---|
String diagrams are a powerful tool for reasoning about composite structures in symmetric monoidal categories. By representing string diagrams as graphs, equational reasoning can be done automatically by double-pushout rewriting. !-graphs give us the means of expressing and proving properties about whole families of these graphs simultaneously. While !-graphs provide elegant proofs of surprisingly powerful theorems, little is known about the formal properties of the graph languages they define. This paper takes the first step in characterising these languages by showing that an important subclass of !-graphs-those whose repeated structures only overlap trivially-can be encoded using a (context-free) vertex replacement grammar. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.4204/EPTCS.181.2 | ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE |
Field | DocType | Issue |
Discrete mathematics,Graph,Vertex (geometry),Equational reasoning,Algorithm,Grammar,Mathematical proof,Rewriting,Mathematics | Journal | 181 |
ISSN | Citations | PageRank |
2075-2180 | 4 | 0.47 |
References | Authors | |
9 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Aleks Kissinger | 1 | 171 | 22.32 |
| Vladimir Zamdzhiev | 2 | 28 | 3.35 |