LARS: a learning algorithm for rewriting systems

DOI10.1007/S10994-006-9593-8MaRDI QIDQ2384128zbMATH OpenOpenAlexFDO

Authors Rémi Eyraud, Jean-Christophe Janodet, Colin de la Higuera

Publication date 20 September 2007

Published in Machine Learning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10994-006-9593-8

zbMATH Keywords

learning context-free languagesrewriting systems

Mathematics Subject Classification ID

Computational learning theory (68Q32) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• A learning algorithm for a subclass of tree rewriting systems
• Grammatical Inference: Algorithms and Applications
• Learning of Church-Rosser tree rewriting systems
• Algorithms for inferring context-sensitive L-systems
• scientific article; zbMATH DE number 176934
• Learning register automata: from languages to program structures
• scientific article; zbMATH DE number 7455725
• Learning in a compiler for MINSAT algorithms
• scientific article; zbMATH DE number 1149414
• scientific article; zbMATH DE number 1692890

Cites work

• A polynomial algorithm testing partial confluence of basic semi-Thue systems
• Algorithmic Learning Theory
• Characteristic sets for polynomial grammatical inference
• Church-Rosser Thue systems and formal languages
• Complexity of automaton identification from given data
• Computing the relative entropy between regular tree languages
• Efficient algorithms for the inference of minimum size DFAs
• Efficient learning of context-free grammars from positive structural examples
• Grammatical inference and applications. 2nd international colloquium, ICGI-94, Alicante, Spain, September 21-23, 1994. Proceedings
• Grammatical inference for even linear languages based on control sets
• Grammatical Inference: Algorithms and Applications
• Grammatical Inference: Algorithms and Applications
• Grammatical inference: Algorithms and applications. 6th international colloquium, ICGI 2002, Amsterdam, the Netherlands, September 23--25, 2002. Proceedings
• scientific article; zbMATH DE number 2089360 (Why is no real title available?)
• scientific article; zbMATH DE number 2089362 (Why is no real title available?)
• scientific article; zbMATH DE number 1142316 (Why is no real title available?)
• scientific article; zbMATH DE number 1149447 (Why is no real title available?)
• scientific article; zbMATH DE number 2019599 (Why is no real title available?)
• scientific article; zbMATH DE number 2019605 (Why is no real title available?)
• scientific article; zbMATH DE number 2019613 (Why is no real title available?)
• scientific article; zbMATH DE number 2080645 (Why is no real title available?)
• scientific article; zbMATH DE number 789389 (Why is no real title available?)
• Incremental learning of context free grammars based on bottom-up parsing and search
• Inferring pure context-free languages from positive data
• Learning context-free grammars from structural data in polynomial time
• On the complexity of teaching
• Polynomial-time identification of very simple grammars from positive data.
• Prefix grammars: An alternative characterization of the regular languages
• Recent advances of grammatical inference
• Stochastic inference of regular tree languages
• Term Rewriting and Applications
• The inference of tree languages from finite samples: An algebraic approach
• Three models for the description of language

Cited in

(3)

• Inductive synthesis of cover-grammars with the help of ant colony optimization
• Efficiency in the identification in the limit learning paradigm
• Grammatical Inference: Algorithms and Applications

Describes a project that uses

Uses Software

• EMILE

This page was built for publication: LARS: a learning algorithm for rewriting systems

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