A learning algorithm for a subclass of tree rewriting systems

MaRDI QIDQ3166166zbMATH OpenFDO

Authors M. Jayasrirani, Atulya K. Nagar, Durairaj Gnanaraj Thomas, T. Robinson

Publication date 21 October 2012

zbMATH Keywords

Church-Rosser tree rewriting systemstree manipulating systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Learning and adaptive systems in artificial intelligence (68T05) Nonnumerical algorithms (68W05)

Recommendations

• Learning of Church-Rosser tree rewriting systems
• Reductions in tree replacement systems
• Grammatical Inference: Algorithms and Applications
• Term rewriting systems: From Church-Rosser to Knuth-Bendix and beyond
• Thue systems and DNA -- a learning algorithm for a subclass

Cited in

(6)

• Reductions in tree replacement systems
• LARS: a learning algorithm for rewriting systems
• Algorithms for learning parsimonious context trees
• Learning of Church-Rosser tree rewriting systems
• Thue systems and DNA -- a learning algorithm for a subclass
• Grammatical Inference: Algorithms and Applications

This page was built for publication: A learning algorithm for a subclass of tree rewriting systems

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