Learning tree languages from positive examples and membership queries
From MaRDI portal
Publication:2381576
DOI10.1016/j.tcs.2007.03.038zbMath1127.68043OpenAlexW2167214386MaRDI QIDQ2381576
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
Computational learning theory (68Q32) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)
Related Items
Four one-shot learners for regular tree languages and their polynomial characterizability ⋮ Learning Tree Languages ⋮ Minimizing deterministic weighted tree automata ⋮ A categorical framework for learning generalised tree automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning context-free grammars from structural data in polynomial time
- Learning regular sets from queries and counterexamples
- Queries and concept learning
- Inference of tree automata from sample set of trees
- Inductive inference of formal languages from positive data
- A note on the number of queries needed to identify regular languages
- Language identification in the limit
- Stochastic inference of regular tree languages