Learning of Church-Rosser tree rewriting systems

DOI10.1007/978-3-642-15488-1_27MaRDI QIDQ3588388zbMATH OpenOpenAlexFDO

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

Publication date 10 September 2010

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

Full work available at URL https://doi.org/10.1007/978-3-642-15488-1_27

Mathematics Subject Classification ID

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

Recommendations

• A learning algorithm for a subclass of tree rewriting systems
• scientific article; zbMATH DE number 177826
• Church-Rosser systems with respect to formal languages
• scientific article; zbMATH DE number 3934390
• Reductions in tree replacement systems

Cited in

(4)

• Reductions in tree replacement systems
• LARS: a learning algorithm for rewriting systems
• A learning algorithm for a subclass of tree rewriting systems
• scientific article; zbMATH DE number 475415 (Why is no real title available?)

This page was built for publication: Learning of Church-Rosser tree rewriting systems

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