Fusion grammars are a novel approach to the generation of hypergraph languages. Context-dependent fusion grammars extend them in such a way that the application of fusion rules can be restricted by positive and negative context conditions. In this paper, we show that several variants of Petri nets can be transformed into these grammars such that the reachable markings are in one-to-one correspondence to the members of the generated language. As this includes place/transition systems with inhibitor arcs, we get as a corollary that context-dependent fusion grammars can generate all recursively enumerable languages.

中文翻译：

---

Petri网的变体转化成上下文相关的融合文法

融合语法是一种新的方法，以超图语言的产生。依赖于上下文的融合文法它们以这样的方式延伸的是融合规则的应用可通过正和负上下文条件的限制。在本文中，我们表明，Petri网的若干变体可以转化成这些文法，使得可到达标记是在一对一的对应于所生成的语言的成员。由于这包括与禁止弧的地方/转换系统，我们得到的推论是依赖于上下文的融合语法可以生成所有递归可枚举语言。