Skip to main content
Conference Proceedings

Closure properties of context-free hyperedge replacement systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1997) 1197 LNCS 101-113
DOI: 10.1007/3-540-62559-3_10
0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Hyperedge replacement systems are investigated in terms of closure properties with respect to language operators such as union, intersection and concatenation. It is shown that context-free HR systems are closed under union, coalesced sum and concatenation but not under intersection, giving an explicit counterexample.

Cite

CITATION STYLE

APA

Ciotti, O., & Parisi-Presicce, F. (1997). Closure properties of context-free hyperedge replacement systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1197 LNCS, pp. 101–113). https://doi.org/10.1007/3-540-62559-3_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free