Characteristics of graph languages generated by edge replacement

DOI10.1016/0304-3975(87)90050-8MaRDI QIDQ1098320zbMATH OpenOpenAlexFDO

Authors Annegret Habel, Hans-Jörg Kreowski

Publication date 1987

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(87)90050-8

zbMATH Keywords

fixed pointsgraph grammarsgraph languagesEdge replacement systems

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4035178
• The complexity of graph languages generated by hyperedge replacement
• scientific article; zbMATH DE number 177465
• Hyperedge replacement: grammars and languages
• On hyperedge replacement and BNLC graph grammars
• scientific article; zbMATH DE number 219258
• Relative expressiveness of the edge/adjacency language for graph theory
• scientific article; zbMATH DE number 522845
• A characterization of the sets of hypertrees generated by hyperedge-replacement graph grammars
• scientific article; zbMATH DE number 177439

Cites work

• scientific article; zbMATH DE number 3644498 (Why is no real title available?)
• scientific article; zbMATH DE number 3139751 (Why is no real title available?)
• scientific article; zbMATH DE number 3823124 (Why is no real title available?)
• scientific article; zbMATH DE number 3827231 (Why is no real title available?)
• scientific article; zbMATH DE number 3550181 (Why is no real title available?)
• scientific article; zbMATH DE number 3557186 (Why is no real title available?)
• scientific article; zbMATH DE number 3633737 (Why is no real title available?)
• scientific article; zbMATH DE number 3633740 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• A characterization of context-free languages
• Cap expressions for context-free languages
• Context-free graph grammars
• Decision problems for node label controlled graph grammars
• Graph-grammars and their application to computer science and biology. International workshop Bad Honnef, October 30 November 3, 1978
• On certain formal properties of grammars
• On the structure of node-label-controlled graph languages
• Pair grammars, graph languages and string-to-graph translations
• Transition network grammars for natural language analysis
• Two Families of Languages Related to ALGOL

Cited in

(17)

• On structured graph grammars. I
• scientific article; zbMATH DE number 1836427 (Why is no real title available?)
• Metatheorems for decision problems on hyperedge replacement graph languages
• scientific article; zbMATH DE number 809155 (Why is no real title available?)
• On structured graph grammars. II
• scientific article; zbMATH DE number 522860 (Why is no real title available?)
• Boundary graph grammars with dynamic edge relabeling
• Labelled stratified graphs can generate formal languages
• Hypermap rewriting: A combinatorial approach
• Graph-theoretic properties compatible with graph derivations
• Node replacement graph languages squeezed with chains, trees, and forests
• scientific article; zbMATH DE number 3915647 (Why is no real title available?)
• Handle NLC grammars and r. e. languages
• On hyperedge replacement and BNLC graph grammars
• Recursively defined tree transductions
• scientific article; zbMATH DE number 4035178 (Why is no real title available?)
• scientific article; zbMATH DE number 177465 (Why is no real title available?)

Describes a project that uses

Uses Software

• ALGOL 60

This page was built for publication: Characteristics of graph languages generated by edge replacement

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