Polynomial time inductive inference of regular term tree languages from positive data
From MaRDI portal
Recommendations
Cited in
(10)- Polynomial-time identification of very simple grammars from positive data.
- A family of languages which is polynomial-time learnable from positive data in pitt's sense
- Inferring pure context-free languages from positive data
- Learning Tree Languages
- Exact Learning of Finite Unions of Graph Patterns from Queries
- scientific article; zbMATH DE number 1552572 (Why is no real title available?)
- Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data
- Inductive Logic Programming
- Inductive inference of unbounded unions of pattern languages from positive data
- Ordered term tree languages which are polynomial time inductively inferable from positive data
This page was built for publication: Polynomial time inductive inference of regular term tree languages from positive data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4370226)