Linear and Context-Free Graph Grammars

DOI10.1145/321679.321682MaRDI QIDQ5637894zbMATH OpenOpenAlexFDO

Authors

Publication date 1972

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321679.321682

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Semantics in the theory of computing (68Q55)

Cited in

(21)

• Graph embedding in SYNCHEM2, an expert system for organic synthesis discovery
• On the generative power of sequential and parallel programmed graph grammars
• The string generating power of context-free hypergraph grammars
• Mosaic grammars
• Network languages for complex systems
• A linguistic approach to geometric reasoning
• Translations of network languages
• A pumping lemma and the structure of derivations in the boundary NLC graph languages
• The generating power of boundary NLC graph grammars and cycle graphs
• Graph grammars according to the type of input and manipulated data: a survey
• Linear graph grammars: Power and complexity
• Rule-based top-down parsing for acyclic contextual hyperedge replacement grammars
• The complexity of graph languages generated by hyperedge replacement
• Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement
• Syntactic/semantic techniques in pattern recognition: A survey
• A structural/temporal query language for business processes
• An algorithm for the inference of tree grammars
• String and graph grammar characterizations of bounded regular languages
• Using attributed flow graph parsing to recognize clichés in programs
• Hyperedge replacement with rendezvous
• Maximum flows in parametric graph templates

This page was built for publication: Linear and Context-Free Graph Grammars

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