Learning mildly context-sensitive languages with multidimensional substitutability from positive data
From MaRDI portal
Recommendations
- Efficient learning of multiple context-free languages with multidimensional substitutability from positive data
- Polynomial identification in the limit of substitutable context-free languages
- Algorithmic Learning Theory
- Identification in the Limit of k,l-Substitutable Context-Free Languages
- Polynomial-time identification of multiple context-free languages from positive data and membership queries
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
- Language identification in the limit
- On multiple context-free grammars
- PAC-Learning Unambiguous NTS Languages
- Polynomial identification in the limit of substitutable context-free languages
Cited in
(13)- Efficient learning of multiple context-free languages with multidimensional substitutability from positive data
- A language theoretic approach to syntactic structure
- Polynomial identification in the limit of substitutable context-free languages
- Inferring Grammars for Mildly Context Sensitive Languages in Polynomial-Time
- Planar Languages and Learnability
- PAC-learning unambiguous \(k,l \mathrm{-NTS}^{\leq}\) languages
- Polynomial-time identification of multiple context-free languages from positive data and membership queries
- Languages as hyperplanes: grammatical inference with string kernels
- scientific article; zbMATH DE number 1182792 (Why is no real title available?)
- Learning subregular classes of languages with factored deterministic automata
- On IO-copying and mildly-context sensitive formalisms
- Algorithmic Learning Theory
- Grammatical Inference: Algorithms and Applications
This page was built for publication: Learning mildly context-sensitive 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 Q3648758)
