Reference16 articles.
1. BAUDERON M., COURCELLE B., Graph expressions and graph rewritings, Mathematical System Theory 20 (1987) 83–127.
2. COURCELLE B., Equivalences and transformations of regular systems. Applications to recursive program schemes and grammars, Theor. Comp. Sci. 42 (1986), 1–122.
3. COURCELLE B., A representation of graphs by algebraic expressions and its use for graph rewriting systems, Proceedings of the 3rd International Workshop on Graph Grammars, L.N.C.S. 291, Springer, 1987, pp. 112–132.
4. COURCELLE B., On context-free sets of graphs and their monadic second-order theory, same volume as [3], pp. 133–146.
5. COURCELLE B., An axiomatic definition of context-free rewriting and its application to NLC graph grammars, Theoretical Computer Science 55 (1987) 141–181.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Parity Games of Bounded Tree- and Clique-Width;Lecture Notes in Computer Science;2015
2. Logic based structure rewriting systems;Graph Transformations in Computer Science;1994
3. An algebraic theory of graph reduction;Journal of the ACM;1993-11
4. Handle-rewriting hypergraph grammars;Journal of Computer and System Sciences;1993-04