Hypergraph languages of bounded degree

DOI10.1016/S0022-0000(05)80022-4MaRDI QIDQ1318469zbMATH OpenOpenAlexFDO

Authors Joost Engelfriet, Linda Heyker

Publication date 27 March 1994

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0022-0000(05)80022-4

zbMATH Keywords

graph languageshypergraph languagehypergraph rewriting grammar

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 177438
• Contextual Hypergraph Grammars – A New Approach to the Generation of Hypergraph Languages
• Handle-rewriting hypergraph grammars
• The generative power of context-free node rewriting in hypergraphs
• scientific article; zbMATH DE number 219258

Cites work

• A comparison of boundary graph grammars and context-free hypergraph grammars
• A Greibach normal form for context-free graph grammars
• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
• Boundary graph grammars with dynamic edge relabeling
• Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
• Context-free hypergraph grammars have the same term-generating power as attribute grammars
• Graph expressions and graph rewritings
• Handle-rewriting hypergraph grammars
• scientific article; zbMATH DE number 3943061 (Why is no real title available?)
• scientific article; zbMATH DE number 4035178 (Why is no real title available?)
• scientific article; zbMATH DE number 4049099 (Why is no real title available?)
• scientific article; zbMATH DE number 4051027 (Why is no real title available?)
• scientific article; zbMATH DE number 4060748 (Why is no real title available?)
• scientific article; zbMATH DE number 17539 (Why is no real title available?)
• scientific article; zbMATH DE number 177438 (Why is no real title available?)
• scientific article; zbMATH DE number 219258 (Why is no real title available?)
• scientific article; zbMATH DE number 809155 (Why is no real title available?)
• Hyperedge replacement: grammars and languages
• Linear graph grammars: Power and complexity
• Nonterminal separation in graph grammars
• The equivalence of boundary and confluent graph grammars on graph languages of bounded degree
• The string generating power of context-free hypergraph grammars

Cited in

(13)

• Hypermap rewriting: A combinatorial approach
• Monadic second-order definable graph transductions: a survey
• The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
• Context-free graph languages of bounded degree are generated by apex graph grammars
• Generating irregular partitionable data structures
• HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting
• Handle-rewriting hypergraph grammars
• scientific article; zbMATH DE number 5178192 (Why is no real title available?)
• scientific article; zbMATH DE number 177438 (Why is no real title available?)
• HRNCE grammars — A hypergraph generating system with an eNCE way of rewriting
• scientific article; zbMATH DE number 809155 (Why is no real title available?)
• A Greibach normal form for context-free graph grammars
• Grammars based on a logic of hypergraph languages

This page was built for publication: Hypergraph languages of bounded degree

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