Fusion grammars: a novel approach to the generation of graph languages
From MaRDI portal
(Redirected from Publication:4972010)
Recommendations
- Splicing/fusion grammars and their relation to hypergraph grammars
- Context-sensitive fusion grammars are universal
- Transformation of variants of Petri nets into context-dependent fusion grammars
- Contextual Hypergraph Grammars – A New Approach to the Generation of Hypergraph Languages
- scientific article; zbMATH DE number 4035178
Cited in
(11)- Splicing/fusion grammars and their relation to hypergraph grammars
- Graph grammars according to the type of input and manipulated data: a survey
- Context-sensitive fusion grammars and fusion grammars with forbidden context are universal
- Deciding non-emptiness of hypergraph languages generated by connection-preserving fusion grammars is NP-complete
- Relating DNA computing and splitting/fusion grammars
- Transformation of variants of Petri nets into context-dependent fusion grammars
- Transformation of Turing machines into context-dependent fusion grammars
- On decidability and expressive power of fusion grammars
- Bonding grammars
- The complexity of recognizing connection-preserving fusion grammars
- Context-sensitive fusion grammars are universal
This page was built for publication: Fusion grammars: a novel approach to the generation of graph languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4972010)