Language identification in the limit
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Toward the interpretation of non-constructive reasoning as non-monotonic learning
- Learning \((k,l)\)-contextual tree languages for information extraction from web pages
- U-shaped, iterative, and iterative-with-counter learning
- Algorithms for learning regular expressions from positive data
- Prescribed learning of r.e. classes
- Parallelism increases iterative learning power
- Incremental learning of approximations from positive data
- One-shot learners using negative counterexamples and nearest positive examples
- Necessary and sufficient conditions for learning with correction queries
- Bridging learning theory and dynamic epistemic logic
- Mind change optimal learning of Bayes net structure from dependency and independency data
- Identification of pattern languages from examples and queries
- Probability and plurality for aggregations of learning machines
- Index sets in the arithmetical hierarchy
- Synthesizing inductive expertise
- Inference of even linear grammars and its application to picture description languages
- On the power of recursive optimizers
- Saving the phenomena: Requirements that inductive inference machines not contradict known data
- Paradigms of truth detection
- Schema induction for logic program synthesis
- On the relative sizes of learnable sets
- Research in the theory of inductive inference by GDR mathematicians - A survey
- Inductive inference from all positive and some negative data
- Learning in the presence of partial explanations
- Learning elementary formal systems
- Efficient learning of context-free grammars from positive structural examples
- Aggregating inductive expertise on partial recursive functions
- Memory systems, computation, and the second law of thermodynamics
- Inductive reasoning and Kolmogorov complexity
- On uniform learnability of language families
- Learning semilinear sets from examples and via queries
- IIPS: A framework for specifying inductive-inference problems
- On the power of inductive inference from good examples
- A mathematical theory of learning transformational grammar
- On the stability of some biological schemes with cellular interactions
- Finite automata and S-R models
- Inference for regular bilanguages
- On the inference of optimal descriptions
- On the inference of strategies
- Learning approximately regular languages with reversible languages
- Investigations on measure-one identification of classes of languages
- A note on batch and incremental learnability
- Learning with refutation
- Stream surface construction using mass conservative interpolation
- On the inductive inference of recursive real-valued functions
- Approximation methods in inductive inference
- Learning via queries and oracles
- The logic of reliable and efficient inquiry
- Maximal machine learnable classes
- Inductive inference in the limit for first-order sentences
- A model for science kinematics
- Extremes in the degrees of inferability
- Structured connectionist models and language learning
- Logic program synthesis from incomplete specifications
- Synthesis of real time acceptors
- Complex systems, complexity measures, grammars and model-inferring
- Characterizing language identification by standardizing operations
- The query complexity of learning DFA
- Program size restrictions in computational learning
- The learnability of description logics with equality constraints
- Learning in the presence of inaccurate information
- On aggregating teams of learning machines
- Learning-theoretic perspectives of acceptable numberings
- Generating grammars for SGML tagged texts lacking DTD
- An interactive learning algorithm for acquisition of concepts represented as CFL
- Kolmogorov numberings and minimal identification
- Recent advances of grammatical inference
- Learning deterministic even linear languages from positive examples
- Probabilistic language learning under monotonicity constraints
- Noisy inference and oracles
- On the intrinsic complexity of learning recursive functions
- Identification of function distinguishable languages.
- Learning how to separate.
- Separation of uniform learning classes.
- Inference of -languages from prefixes.
- Learning by switching type of information.
- Algorithmic complexity of recursive and inductive algorithms
- Experience, generations, and limits in machine learning
- An average-case optimal one-variable pattern language learner
- Learning languages and functions by erasing
- Some classes of Prolog programs inferable from positive data
- Structural measures for games and process control in the branch learning model
- Ordinal mind change complexity of language identification
- Mind change complexity of learning logic programs
- Language learning from texts: Degrees of intrinsic complexity and their characterizations
- On learning formulas in the limit and with assurance.
- Inductive inference with additional information.
- Generalized logical consequence: Making room for induction in the logic of science
- Inferring regular languages and \(\omega\)-languages
- Open problems in universal induction \& intelligence
- Learning pattern languages over groups
- A theory of formal synthesis via inductive learning
- Grammatical inference of directed acyclic graph languages with polynomial time complexity
- Learnability of automatic classes
- Learning local transductions is hard
- Semantic bootstrapping of type-logical grammar
- Increasing the power of uniform inductive learners
- Evolutionary game dynamics in populations with different learners
- Equivalences between learning of data and probability distributions, and their applications
- Trade-off among parameters affecting inductive inference
This page was built for publication: Language identification in the limit
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5674988)