Abstract
We introduce basic atom replacement in hypergraphs, which allows us to combine node-rewriting steps and hyperedge-rewriting steps within one type of grammar. The generated languages are closed under hyperedge substitution, thereby providing a structured way to build complex hypergraph languages from simple ones. In particular, there are basic atom-replacement languages which cannot be generated by any type of context-free hypergraph grammar.
Cite
CITATION STYLE
Klempien-Hinrichs, R. (2002). Hyperedge substitution in basic atom-replacement languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2505, pp. 192–206). Springer Verlag. https://doi.org/10.1007/3-540-45832-8_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
