Polynomial identification in the limit of substitutable context-free languages
From MaRDI portal
Recommendations
- Algorithmic Learning Theory
- Identification in the Limit of k,l-Substitutable Context-Free Languages
- Efficient learning of multiple context-free languages with multidimensional substitutability from positive data
- Learning mildly context-sensitive languages with multidimensional substitutability from positive data
- A Polynomial Algorithm for the Inference of Context Free Languages
Cited in
(26)- Learning efficiency of very simple grammars from positive data
- Grammatical inference of directed acyclic graph languages with polynomial time complexity
- Synthesizing context-free grammars from recurrent neural networks
- Learning algorithms
- Efficient learning of multiple context-free languages with multidimensional substitutability from positive data
- scientific article; zbMATH DE number 1670721 (Why is no real title available?)
- Learning trees from strings: a strong learning algorithm for some context-free grammars
- Efficiency in the identification in the limit learning paradigm
- Distributional Learning of Context-Free and Multiple Context-Free Grammars
- Learning the language of biological sequences
- A Polynomial-Time Algorithm for Computing Finite-Makespan Controllable Sublanguages
- A language theoretic approach to syntactic structure
- Learning Left-to-Right and Right-to-Left Iterative Languages
- Identification in the Limit of k,l-Substitutable Context-Free Languages
- A Polynomial Algorithm for the Inference of 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
- Languages as hyperplanes: grammatical inference with string kernels
- scientific article; zbMATH DE number 1796949 (Why is no real title available?)
- Distributional learning of parallel multiple context-free grammars
- Learning an efficient constructive sampler for graphs
- Algorithmic Learning Theory
- Probabilistic learnability of context-free grammars with basic distributional properties from positive examples
- Analyzing robustness of Angluin's L^* algorithm in presence of noise
- An active learning algorithm for bidirectional deterministic finite automata
- Learning in the limit with lattice-structured hypothesis spaces
This page was built for publication: Polynomial identification in the limit of substitutable context-free languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174138)
