Learning of ordered tree languages with height-bounded variables using queries
From MaRDI portal
Recommendations
- Learning of finite unions of tree patterns with internal structured variables from queries
- Efficient learning of ordered and unordered tree patterns with contractible variables
- Polynomial time inductive inference of ordered tree patterns with internal structured variables from positive data
- Learning of finite unions of tree patterns with repeated internal structured variables from queries
- On exact learning of unordered tree patterns
Cited in
(11)- On the hardness of learning queries from tree structured data
- Learning tree languages from positive examples and membership queries
- On the regularity and learnability of ordered DAG languages
- Learning tree languages from text
- Learning of finite unions of tree patterns with internal structured variables from queries
- Efficient learning of semi-structured data from queries
- Efficient learning of ordered and unordered tree patterns with contractible variables
- Learning of finite unions of tree patterns with repeated internal structured variables from queries
- On exact learning of unordered tree patterns
- Ordered term tree languages which are polynomial time inductively inferable from positive data
- Query learning of regular tree languages: How to avoid dead states
This page was built for publication: Learning of ordered tree languages with height-bounded variables using queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5464514)