Linear and Context-Free Graph Grammars

DOI10.1145/321679.321682zbMath0229.68027OpenAlexW2083312088MaRDI QIDQ5637894

No author found.

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

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

Related Items

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