Deciding Non-emptiness of Hypergraph Languages Generated by Connection-preserving Fusion Grammars is NP-complete.

Aaron Lye

Browse the full LATA paper archive.