Aaron Lye. Deciding Non-emptiness of Hypergraph Languages Generated by Connection-preserving Fusion Grammars is NP-complete. In Alberto Leporati, Carlos MartÃn-Vide, Dana Shapira, Claudio Zandron, editors, Language and Automata Theory and Applications - 15th International Conference, LATA 2021, Milan, Italy, March 1-5, 2021, Proceedings. Volume 12638 of Lecture Notes in Computer Science, pages 97-108, Springer, 2021. [doi]
Abstract is missing.