A characterization of the sets of hypertrees generated by hyperedge-replacement graph grammars
type: Item
instance of: scholarly article
title: A characterization of the sets of hypertrees generated by hyperedge-replacement graph grammars
zbMATH Open document ID: 0916.68110
author: Frank Drewes
published in: Theory of Computing Systems
publication date: 1999-03-22T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1268692
zbMATH Keywords: languages of hypertrees
zbMATH Keywords: hyperedge-replacement graph grammars
MaRDI profile type: Publication
full work available at URL: s002240000115
OpenAlex ID: W2065255929
DOI: 10.1007/S002240000115
Recommended article: Q4852905
Recommended article: Q5201129
Recommended article: Q3774975
Recommended article: Q3070891
Recommended article: The complexity of graph languages generated by hyperedge replacement
Recommended article: On hyperedge replacement and BNLC graph grammars
Recommended article: Q4694744
Recommended article: Q4284239
Recommended article: An Algorithm for Hypergraph Completion According to Hyperedge Replacement Grammars
Recommended article: Hyperedge replacement: grammars and languages
description: scientific article; zbMATH DE number 1268692