Paper Info
Title
Characteristics of graph languages Generated by edge replacement
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.
Year
DOI
Venue
1987
10.1016/0304-3975(87)90050-8
Theor. Comput. Sci.
Keywords
DocType
Volume
graph language,edge replacement
Journal
51
Issue
ISSN
Citations 
1-2
Theoretical Computer Science
24
PageRank 
References 
Authors
2.20
10
2
Name
Order
Citations
PageRank
Annegret Habel123423.18
Hans-jörg Kreowski229837.05