scientific article; zbMATH DE number 965

MaRDI QIDQ4711083zbMATH OpenFDO

Authors Annegret Habel, Hans-Jörg Kreowski, Walter Vogler

Publication date 25 June 1992

zbMATH Keywords

boundedness problemdecision problemsgraph grammarshyperedge-replacement

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Hyperedge replacement: grammars and languages
• Metatheorems for decision problems on hyperedge replacement graph languages
• scientific article; zbMATH DE number 4087049
• scientific article; zbMATH DE number 809155

Cited in

(18)

• Metatheorems for decision problems on hyperedge replacement graph languages
• Decidability of the finiteness of ranges of tree transductions
• Nondeterministic operations on finite relational structures
• Finite tree automata with cost functions
• On the decidability of certain integer subgraph problems on context-free graph languages
• The complexity of connectivity problems on context-free graph languages
• Context-free graph languages of bounded degree are generated by apex graph grammars
• Logical description of context-free graph languages
• A comparison of compatible, finite, and inductive graph properties
• Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
• scientific article; zbMATH DE number 4087049 (Why is no real title available?)
• scientific article; zbMATH DE number 177454 (Why is no real title available?)
• Least solutions of equations over \(\mathcal{N}\)
• Decision problems for edge grammars
• The bounded degree problem for NLC grammars is decidable
• Graph-theoretic properties compatible with graph derivations
• Hyperedge replacement: grammars and languages
• Edge-label controlled graph grammars

This page was built for publication:

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