Learning Node Label Controlled Graph Grammars (Extended Abstract)

DOI10.1007/978-3-540-88009-7_24MaRDI QIDQ3528431zbMATH OpenOpenAlexFDO

Authors Christophe Costa Florêncio

Publication date 16 October 2008

Published in Grammatical Inference: Algorithms and Applications (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Computational learning theory (68Q32) Grammars and rewriting systems (68Q42)

Recommendations

• Learning Tree Patterns from Example Graphs
• On the inference of non-confluent NLC graph grammars
• Graph-based mining of complex data
• The Complexity of Learning Tree Patterns from Example Graphs
• Designing and Learning Substitutable Plane Graph Grammars

Cites work

• scientific article; zbMATH DE number 67629 (Why is no real title available?)
• Language identification in the limit

Cited in

(4)

• Grammatical inference of directed acyclic graph languages with polynomial time complexity
• Learning molecular classes from small numbers of positive examples using graph grammars
• scientific article; zbMATH DE number 4182839 (Why is no real title available?)
• Learning of restricted RNLC graph languages

This page was built for publication: Learning Node Label Controlled Graph Grammars (Extended Abstract)

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