|
(home) (research subjects)
|
|
|
|
|
|
| Small graph rewrites systems |
|
|
|
|
|
| Sticks-and-rings graphs are graphs made of loops, 1-valent or 3-valent colored nodes. These graphs can be unoriented or oriented. In the unoriented case the edges don't have an orientation and each 3-valent node comes with a partition of its 3 edges into a 2-set and a 1-set. In the oriented case the edges are oriented, each 3-valent node has a partition of its 3 edges into a 2-set and a 1-set and moreover the 2-set is made by an incoming and an outgoing edge. |
|
|
|
| Graph rewrites on stick-and-ring graphs are graph rewrites which are conservative in the number of colored nodes. |
|
|
|
|
|
|
System IC2 v1 (unoriented, 2 colors)
|
|
|
|
System SH2 v2 (unoriented, 2 colors)
|
|
|
|
System X v1 (unoriented, 2 colors)
|
|
|
|
Chemlambda strings (oriented, 3 colors)
|
|
|
|
|
|
|
|