Lye, A.
Deciding Non-Emptiness of Hypergraph Languages Generated by Connection-preserving Fusion Grammars is NP-complete
In: Leporati, A.; Martin-Vide, C.; Shapira, D.; Zandron, C. (eds.): Proceedings 15th International Conference on Language and Automata Theory and Applications (LATA 2021). 2021, pp. 97-108
(Workgroup:
Theoretical Computer Science)
