Subject
General Computer Science,Theoretical Computer Science
Reference31 articles.
1. How to construct a hyperedge replacement system for a context-free set of hypergraphs;Barthelmann,1996
2. Graph expressions and graph rewritings;Bauderon;Math. Systems Theory,1987
3. Graph rewriting: an algebraic and logic approach;Courcelle,1990
4. The monadic second-order logic of graphs. I. Recognizable sets of finite graphs;Courcelle;Inform. and Comput.,1990
5. The monadic second-order logic of graphs V: on closing the gap between definability and recognizability;Courcelle;Theoret. Comput. Sci.,1991