HRNCE grammars — A hypergraph generating system with an eNCE way of rewriting

DOI10.1007/3-540-61228-9_100MaRDI QIDQ4645289zbMATH OpenOpenAlexFDO

Authors Changwook Kim, Tae Eui Jeong

Publication date 10 January 2019

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61228-9_100

Mathematics Subject Classification ID

Hypergraphs (05C65) Grammars and rewriting systems (68Q42)

Cites work

• A comparison of boundary graph grammars and context-free hypergraph 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
• Complexity of boundary graph languages
• Graph expressions and graph rewritings
• Handle-rewriting hypergraph grammars
• scientific article; zbMATH DE number 3885330 (Why is no real title available?)
• scientific article; zbMATH DE number 4035178 (Why is no real title available?)
• Hypergraph languages of bounded degree
• Linear graph grammars: Power and complexity
• On the structure of node-label-controlled graph languages
• Restrictions, extensions, and variations of NLC grammars
• The complexity of graph languages generated by hyperedge replacement
• The complexity of regular DNLC graph languages

Cited in

(2)

• Node rewriting in graphs and hypergraphs: A categorical framework
• Node rewriting in hypergraphs

This page was built for publication: HRNCE grammars — A hypergraph generating system with an eNCE way of rewriting

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