It is well known that hyperedge-replacement grammars can generate NP-complete graph languages even under seemingly harsh restrictions. This means that the parsing problem is difficult even in the non-uniform setting, in which the grammar is considered to be fixed rather than being part of the input. Little is known about restrictions under which truly uniform polynomial parsing is possible. In this paper we propose a low-degree polynomial-time algorithm that solves the uniform parsing problem for a restricted type of hyperedge-replacement grammars which we expect to be of interest for practical applications.

中文翻译：

---

统一解析超边替换语法

众所周知，即使在看似严格的限制下，超边替换语法也可以生成NP完全图语言。这意味着即使在语法被认为是固定的而不是输入的一部分的非均匀设置中，解析问题也很困难。关于限制的了解甚少，在限制之下，真正统一的多项式解析是可能的。在本文中，我们提出了一种低阶多项式时间算法，该算法解决了受限类型的超边缘替换语法的统一解析问题，我们希望在实际应用中对此感兴趣。