Grammatical Inference: Algorithms and Applications

DOI10.1007/B101520MaRDI QIDQ5493013zbMATH OpenOpenAlexFDO

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

Publication date 20 October 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

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

• LARS: a learning algorithm for rewriting systems
• Algorithmic Learning Theory
• Learning trees from strings: a strong learning algorithm for some context-free grammars
• scientific article; zbMATH DE number 992013
• A learning algorithm for a subclass of tree rewriting systems

Cited in

(6)

• Learning deterministic context free grammars: the Omphalos competition
• LARS: a learning algorithm for rewriting systems
• A learning algorithm for a subclass of tree rewriting systems
• Learning Left-to-Right and Right-to-Left Iterative Languages
• Set-driven and rearrangement-independent learning of recursive languages
• Learning of restricted RNLC graph languages

This page was built for publication: Grammatical Inference: Algorithms and Applications

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