Context-free graph grammars

DOI10.1016/S0019-9958(78)90528-4MaRDI QIDQ4155839zbMATH OpenFDO

Authors P. Della Vigna, Carlo Ghezzi

Publication date 1978

Published in Information and Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(10)

• Graph grammars according to the type of input and manipulated data: a survey
• The complexity of graph languages generated by hyperedge replacement
• Context-free grammars as a tool for describing polynomial-time subclasses of hard problems
• String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing
• Power properties of NLC graph grammars with a polynomial membership problem
• Graph grammars with neighbourhood-controlled embedding
• Characteristics of graph languages generated by edge replacement
• Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement
• On the generative power of sequential and parallel programmed graph grammars
• Using attributed flow graph parsing to recognize clichés in programs

This page was built for publication: Context-free graph grammars

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