  We prove decidability of the non-emptiness problems for fusion grammars and
decidability of the membership problem for fusion grammars without markers and
connectors. Additionally, we prove the Parikh theorem for connection-preserving
fusion grammars.
