Characteristics of graph languages generated by edge replacement Export

@article{citeulike:5938558, abstract = {Edge replacement systems provide a simple mechanism for generating graph languages. They generalize context-free (string) grammars to the case of graphs. This paper summarizes some recent results on graph languages generated by edge replacement. In particular, we show that the languages are fixed points of their productions (considered as equations) and that they can be generated by language operations (substitution and iteration) from finite graph languages.}, author = {Habel, A.}, citeulike-article-id = {5938558}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/0304-3975(87)90050-8}, citeulike-linkout-1 = {http://linkinghub.elsevier.com/retrieve/pii/0304-3975(87)90050-8}, doi = {10.1016/0304-3975(87)90050-8}, issn = {03043975}, journal = {Theoretical Computer Science}, keywords = {grammars, graph}, number = {1-2}, pages = {81--115}, posted-at = {2009-10-14 09:26:52}, priority = {2}, title = {Characteristics of graph languages generated by edge replacement}, url = {http://dx.doi.org/10.1016/0304-3975(87)90050-8}, volume = {51}, year = {1987} }

TY - JOUR ID - citeulike:5938558 L3 - citeulike-article-id:5938558 N2 - Edge replacement systems provide a simple mechanism for generating graph languages. They generalize context-free (string) grammars to the case of graphs. This paper summarizes some recent results on graph languages generated by edge replacement. In particular, we show that the languages are fixed points of their productions (considered as equations) and that they can be generated by language operations (substitution and iteration) from finite graph languages. IS - 1-2 JF - Theoretical Computer Science SN - 03043975 EP - 115 TI - Characteristics of graph languages generated by edge replacement VL - 51 SP - 81 KW - grammars KW - graph AU - Habel, A PY - 1987/// UR - http://dx.doi.org/10.1016/0304-3975(87)90050-8 ER -