Learning of restricted RNLC graph languages

DOI10.1007/BFB0015421MaRDI QIDQ6487959zbMATH OpenFDO

Authors Seiichi Tani, Koichi Yamazaki

Publication date 21 March 2023

Full work available at URL https://doi.org/10.1007/BFB0015421

Mathematics Subject Classification ID

Computational learning theory (68Q32) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45) Nonnumerical algorithms (68W05) Analysis of algorithms (68W40)

Recommendations

• Connectionist learning of regular graph grammars
• Restrictions on NLC graph grammars
• Partial learning of recursively enumerable languages
• Partial learning of recursively enumerable languages
• Grammatical Inference: Algorithms and Applications
• Learning Node Label Controlled Graph Grammars (Extended Abstract)
• scientific article; zbMATH DE number 2080921
• The complexity of regular DNLC graph languages
• Learning Rational Stochastic Tree Languages

Cites work

• A normal form problem for unlabeled boundary NLC graph languages
• A pumping lemma and the structure of derivations in the boundary NLC graph languages
• Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
• Graph expressions and graph rewritings
• scientific article; zbMATH DE number 1142299 (Why is no real title available?)
• Learning regular sets from queries and counterexamples
• Learning semilinear sets from examples and via queries
• On the membership problem for regular DNLC grammars
• On the structure of node-label-controlled graph languages
• Queries and concept learning

This page was built for publication: Learning of restricted RNLC graph languages

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