Abstract
In this note, we recall the basic features of hyperedge replacement as one of the most elementary and frequently used concepts of graph rewriting. Moreover, we discuss the Contextfreeness Lemma for derivations in hyperedge-replacement grammars.
Author supplied keywords
Cite
CITATION STYLE
APA
Drewes, F., & Kreowski, H. J. (1991). A note on hyperedge replacement. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 532 LNCS). Springer Verlag. https://doi.org/10.1007/BFb0017373
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free