Deciding non-emptiness of hypergraph languages generated by connection-preserving fusion grammars is NP-complete (Q2232268)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deciding non-emptiness of hypergraph languages generated by connection-preserving fusion grammars is NP-complete |
scientific article |
Statements
Deciding non-emptiness of hypergraph languages generated by connection-preserving fusion grammars is NP-complete (English)
0 references
4 October 2021
0 references
