Deciding non-emptiness of hypergraph languages generated by connection-preserving fusion grammars is NP-complete

DOI10.1007/978-3-030-68195-1_8MaRDI QIDQ2232268zbMATH OpenOpenAlexFDO

Authors Aaron Lye

Publication date 4 October 2021

Full work available at URL https://doi.org/10.1007/978-3-030-68195-1_8

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• `` Strong NP-Completeness Results
• A simple notion of parallel graph transformation and its perspectives
• Computationally Related Problems
• Context-sensitive fusion grammars are universal
• Fusion grammars: a novel approach to the generation of graph languages
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• Hyperedge replacement: grammars and languages
• Transformation of Petri nets into context-dependent fusion grammars

Cited in

(2)

• On decidability and expressive power of fusion grammars
• The complexity of recognizing connection-preserving fusion grammars

This page was built for publication: Deciding non-emptiness of hypergraph languages generated by connection-preserving fusion grammars is NP-complete

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2232268)