Uniform parsing for hyperedge replacement grammars
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....
Saved in:
Published in | Journal of computer and system sciences Vol. 118; pp. 1 - 27 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
Elsevier Inc
01.06.2021
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | 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. |
---|---|
ISSN: | 0022-0000 1090-2724 1090-2724 |
DOI: | 10.1016/j.jcss.2020.10.002 |