(home) (research subjects)




Small graph rewrites systems 



Sticksandrings graphs are graphs made of loops, 1valent or 3valent colored nodes. These graphs can be unoriented or oriented. In the unoriented case the edges don't have an orientation and each 3valent node comes with a partition of its 3 edges into a 2set and a 1set. In the oriented case the edges are oriented, each 3valent node has a partition of its 3 edges into a 2set and a 1set and moreover the 2set is made by an incoming and an outgoing edge. 


Graph rewrites on stickandring 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)




