Learning tree languages from positive examples and membership queries

DOI10.1016/J.TCS.2007.03.038MaRDI QIDQ2381576zbMATH OpenOpenAlexFDO

Authors Jérôme Besombes, Jean-Yves Marion

Publication date 18 September 2007

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2007.03.038

zbMATH Keywords

learninggrammatical inferencequeriesregular tree languagepositive example

Mathematics Subject Classification ID

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

Recommendations

• Algorithmic Learning Theory
• Learning regular tree languages from correction and equivalence queries
• Algorithmic Learning Theory
• Learning tree languages from text
• scientific article; zbMATH DE number 2089360
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Learning languages from positive data and a finite number of queries
• Language learning from membership queries and characteristic examples
• Learning indexed families of recursive languages from positive data: A survey
• Efficient learning of context-free grammars from positive structural examples

Cites work

• scientific article; zbMATH DE number 2089360 (Why is no real title available?)
• scientific article; zbMATH DE number 58315 (Why is no real title available?)
• scientific article; zbMATH DE number 1233727 (Why is no real title available?)
• scientific article; zbMATH DE number 2040913 (Why is no real title available?)
• A note on the number of queries needed to identify regular languages
• Inductive inference of formal languages from positive data
• Inference of tree automata from sample set of trees
• Language identification in the limit
• Learning context-free grammars from structural data in polynomial time
• Learning regular sets from queries and counterexamples
• Queries and concept learning
• Stochastic inference of regular tree languages

Cited in

(9)

• Query learning of regular tree languages: How to avoid dead states
• A categorical framework for learning generalised tree automata
• A Learning Algorithm for Multi-dimensional Trees, or: Learning Beyond Context-Freeness
• Algorithmic Learning Theory
• Learning regular tree languages from correction and equivalence queries
• Minimizing deterministic weighted tree automata
• Learning Tree Languages
• scientific article; zbMATH DE number 2089360 (Why is no real title available?)
• Four one-shot learners for regular tree languages and their polynomial characterizability

This page was built for publication: Learning tree languages from positive examples and membership queries

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