LARS: a learning algorithm for rewriting systems

DOI10.1007/s10994-006-9593-8zbMath1470.68055OpenAlexW2122061778MaRDI QIDQ2384128

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

rewriting systemslearning context-free languages

Mathematics Subject Classification ID

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

Related Items (2)

Inductive synthesis of cover-grammars with the help of ant colony optimization ⋮ Efficiency in the Identification in the Limit Learning Paradigm

Uses Software

• EMILE

Cites Work

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

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