We introduce bonding grammars, a graph grammar formalism developed to model DNA computation by means of graph transformations. It is a modification of fusion grammars introduced by Kreowski, Kuske and Lye in 2017. Bonding is a graph transformation that consists of merging two hyperedges into a single larger one. We show why bonding better reflects interaction between DNA molecules than fusion. We prove that bonding grammars naturally generalise regular sticker systems. We also study the relation between bonding grammars and hyperedge replacement grammars proving that each of these kinds of grammars generates a language the other one cannot generate. Finally, we prove that the membership problem for bonding grammars is NP-complete and, moreover, that some bonding grammar generates an NP-complete set.

中文翻译：

---

结合语法

我们引入了键合语法，这是一种图语法形式，旨在通过图转换来模拟 DNA 计算。它是 Kreowski、Kuske 和 Lye 在 2017 年提出的融合语法的修改版。 Bonding 是一种图转换，包括将两个超边合并为一个较大的超边。我们展示了为什么键合比融合更能反映 DNA 分子之间的相互作用。我们证明粘合语法自然地概括了常规贴纸系统。我们还研究了键合语法和超边替换语法之间的关系，证明每种语法都能生成另一种语法无法生成的语言。最后，我们证明键合语法的隶属问题是 NP 完全的，而且某些键合语法生成 NP 完全集。