Parallel hyperedge replacement

MaRDI QIDQ4036775zbMATH OpenFDO

Authors Hans-Jörg Kreowski

Publication date 18 May 1993

zbMATH Keywords

graph grammarshyperedge replacementOL systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Review text

[For the entire collection see Zbl 0755.00005.] ``The paper presents the very first steps of a systematic study of hyperedge replacement grammars with a parallel mode of rewriting as known from \(L\) systems. After giving (detailed) definitions and examples (leading to HTOL HR grammars = hybrid table-controlled OL hyperedge replacement grammars), it is proved that the emptiness problem is decidable for HTOL HR grammars, then the power of some special cases are investigated, and directions for further investigations are pointed out.

Recommendations

• scientific article; zbMATH DE number 522836
• Hyperedge replacement with rendezvous
• Hyperedge replacement: grammars and languages
• From parallel graph grammars to parallel high-level replacement systems
• A note on hyperedge replacement

Cited in

(10)

• The translation power of top-down tree-to-graph transducers
• Parallel high-level replacement systems
• scientific article; zbMATH DE number 992017 (Why is no real title available?)
• A note on hyperedge replacement
• scientific article; zbMATH DE number 522836 (Why is no real title available?)
• Contextual hyperedge replacement
• scientific article; zbMATH DE number 7456062 (Why is no real title available?)
• Hyperedge replacement with rendezvous
• Amalgamated graph transformations and their use for specifying AGG -- an algebraic graph grammar system
• Hyperedge replacement: grammars and languages

This page was built for publication: Parallel hyperedge replacement

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