Efficiency in the Identification in the Limit Learning Paradigm
From MaRDI portal
Publication:2963593
DOI10.1007/978-3-662-48395-4_2zbMath1404.68060OpenAlexW2501156850MaRDI QIDQ2963593
Jeffrey Heinz, Rémi Eyraud, Ryo Yoshinaka
Publication date: 15 February 2017
Published in: Topics in Grammatical Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-48395-4_2
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributional learning of parallel multiple context-free grammars
- Learning register automata: from languages to program structures
- Polynomial time learning of simple deterministic languages via queries and a representative sample
- From learning in the limit to stochastic finite learning
- Learning efficiency of very simple grammars from positive data
- Finding patterns common to a set of strings
- On multiple context-free grammars
- Efficient learning of context-free grammars from positive structural examples
- Characteristic sets for polynomial grammatical inference
- Polynomial-time identification of very simple grammars from positive data.
- On polynomial-time learnability in the limit of strictly deterministic automata
- LARS: a learning algorithm for rewriting systems
- Efficient learning of multiple context-free languages with multidimensional substitutability from positive data
- Learnability and the Vapnik-Chervonenkis dimension
- A theory of the learnable
- Inductive inference of formal languages from positive data
- Learning Simple Concepts under Simple Distributions
- A solution of the syntactical induction-inference problem for regular languages
- Toward a mathematical theory of inductive inference
- Three models for the description of language
- Language identification in the limit
- VC-dimensions of finite automata and commutative finite automata with \(k\) letters and \(n\) states
This page was built for publication: Efficiency in the Identification in the Limit Learning Paradigm
