Learning a regular tree language from a teacher
From MaRDI portal
Recommendations
- Learning of Regular ω-Tree Languages
- Learning Tree Languages
- Learning regular tree languages from correction and equivalence queries
- Learning tree languages from text
- Learning tree languages from text
- Learning regular languages from counterexamples
- Learning Rational Stochastic Tree Languages
- Learning Commutative Regular Languages
- Query learning of regular tree languages: How to avoid dead states
- Partial learning of recursively enumerable languages
Cited in
(17)- Learning algorithms
- A categorical framework for learning generalised tree automata
- Learning pomset automata
- Learning tree languages from positive examples and membership queries
- Learning Tree Languages
- Learning tree languages from text
- Learning tree languages from text
- Learning regular tree languages from correction and equivalence queries
- Learning Deterministically Recognizable Tree Series — Revisited
- Learning Meets Verification
- Four one-shot learners for regular tree languages and their polynomial characterizability
- Learning definable hypotheses on trees
- Algorithmic Learning Theory
- Active learning of upward-closed sets of words ((co)algebraic pearl)
- Learning bottom-up tree automata valued in monoidal categories
- Active learning techniques for pomset recognizers
- Query learning of regular tree languages: How to avoid dead states
This page was built for publication: Learning a regular tree language from a teacher
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452069)
