Efficient learning of multiple context-free languages with multidimensional substitutability from positive data
From MaRDI portal
Publication:2431429
Recommendations
- Learning mildly context-sensitive languages with multidimensional substitutability from positive data
- Polynomial-time identification of multiple context-free languages from positive data and membership queries
- Polynomial identification in the limit of substitutable context-free languages
- Identification in the Limit of k,l-Substitutable Context-Free Languages
- Algorithmic Learning Theory
Cites work
- A Learning Algorithm for Multi-dimensional Trees, or: Learning Beyond Context-Freeness
- A Polynomial Algorithm for the Inference of Context Free Languages
- Algorithmic Learning Theory
- Characteristic sets for polynomial grammatical inference
- Grammatical Inference: Algorithms and Applications
- Grammatical inference: Algorithms and applications. 8th international colloquium, ICGI 2006, Tokyo, Japan, September 20--22, 2006. Proceedings
- Grammatical inference: Algorithms and applications. 9th international colloquium, ICGI 2008, Saint-Malo, France, September 22--24, 2008. Proceedings
- Identification in the Limit of k,l-Substitutable Context-Free Languages
- Independent parallelism in finite copying parallel rewriting systems
- Inference of Reversible Languages
- Inferring Grammars for Mildly Context Sensitive Languages in Polynomial-Time
- Iterative learning of simple external contextual languages
- Iterative Learning of Simple External Contextual Languages
- Language identification in the limit
- Learning mildly context-sensitive languages with multidimensional substitutability from positive data
- On multiple context-free grammars
- PAC-Learning Unambiguous NTS Languages
- Polynomial identification in the limit of substitutable context-free languages
- Polynomial Time Learning of Some Multiple Context-Free Languages with a Minimally Adequate Teacher
- Polynomial-time identification of multiple context-free languages from positive data and membership queries
- The mathematics of language
Cited in
(18)- PAC Learning of Some Subclasses of Context-Free Grammars with Basic Distributional Properties from Positive Data
- Using contextual representations to efficiently learn context-free languages
- Gold-style learning theory. A selection of highlights since Gold
- Efficiency in the identification in the limit learning paradigm
- Distributional Learning of Context-Free and Multiple Context-Free Grammars
- Polynomial Time Learning of Some Multiple Context-Free Languages with a Minimally Adequate Teacher
- Polynomial identification in the limit of substitutable context-free languages
- Polynomial-time identification of multiple context-free languages from positive data and membership queries
- Learning mildly context-sensitive languages with multidimensional substitutability from positive data
- scientific article; zbMATH DE number 1182792 (Why is no real title available?)
- Learning subregular classes of languages with factored deterministic automata
- Distributional learning of parallel multiple context-free grammars
- Algorithmic Learning Theory
- Grammatical Inference: Algorithms and Applications
- scientific article; zbMATH DE number 2209444 (Why is no real title available?)
- Efficient learning of tier-based strictly k-local languages
- Probabilistic learnability of context-free grammars with basic distributional properties from positive examples
- An active learning algorithm for bidirectional deterministic finite automata
This page was built for publication: Efficient learning of multiple context-free languages with multidimensional substitutability from positive data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2431429)
