On the inference of non-confluent NLC graph grammars

DOI10.1093/logcom/exr046zbMath1284.68307OpenAlexW2043659127WikidataQ58012249 ScholiaQ58012249MaRDI QIDQ2843997

Robert Brijder, Hendrik Blockeel

Publication date: 27 August 2013

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/289838

zbMATH Keywords

graph grammarsgrammar inference

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Grammars and rewriting systems (68Q42)

Related Items (1)

Graph grammars according to the type of input and manipulated data: a survey

This page was built for publication: On the inference of non-confluent NLC graph grammars