Language identification in the limit

Cited in

(only showing first 100 items - show all)

Inductive inference in the limit of empirically adequate theories
Learning and classifying
Fluctuations, effective learnability and metastability in analysis
Language learning without overgeneralization
Generating grammars for SGML tagged texts lacking DTD
An interactive learning algorithm for acquisition of concepts represented as CFL
DKL: an efficient algorithm for learning deterministic Kripke structures
An average-case optimal one-variable pattern language learner
Constructive reinforcement learning
Induction by enumeration
The complexity of universal text-learners.
Learning grammars and automata with queries
Inference for regular bilanguages
MAT learners for tree series: an abstract data type and two realizations
Input-output identification of controlled discrete manufacturing systems
Infinite Arrays and Domino Systems
A grammatical inference for harmonic linear languages
Solving divergence in Knuth--Bendix completion by enriching signatures
Automatic learning of subclasses of pattern languages
Robust learning of automatic classes of languages
Parallelism Increases Iterative Learning Power
Set-driven and rearrangement-independent learning of recursive languages
Learning Left-to-Right and Right-to-Left Iterative Languages
On the role of update constraints and text-types in iterative learning
Applying formal concepts to learning systems validation
The functions of finite support: a canonical learning problem
Incremental Learning with Ordinal Bounded Example Memory
Learning discrete categorial grammars from structures
Maps of restrictions for behaviourally correct learning
Kolmogorov numberings and minimal identification
On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings
Program size restrictions in computational learning
Normal forms for semantically witness-based learners in inductive inference
Efficient learning of multiple context-free languages with multidimensional substitutability from positive data
On the inference of optimal descriptions
Learning in the presence of partial explanations
Learning a subclass of regular patterns in polynomial time
Probabilistic and pluralistic learners with mind changes
On learning formulas in the limit and with assurance.
Hartmanis-Stearns Conjecture on Real Time and Transcendence
2011 North American Annual Meeting of the Association for Symbolic Logic, University of California at Berkeley, Berkeley, CA, USA, March 24--27, 2011
Noisy inference and oracles
Prediction of Recursive Real-Valued Functions from Finite Examples
Inferring regular languages by merging nonterminals
On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms
Equivalences between learning of data and probability distributions, and their applications
Costs of general purpose learning
One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples
The myth of `the myth of hypercomputation'
Investigations on measure-one identification of classes of languages
Learning languages from positive data and a limited number of short counterexamples
Numberings optimal for learning
Learning languages from positive data and a finite number of queries
Characterizing language identification by standardizing operations
Fast learning of restricted regular expressions and dtds
The learnability of description logics with equality constraints
The complexity of finding SUBSEQ(A)
On the inference of Turing machines from sample computations
TeLEx: learning signal temporal logic from positive examples using tightness metric
E-generalization using grammars
Decision lists over regular patterns.
Learning power and language expressiveness.
Learnability of type-logical grammars
Reflecting and self-confident inductive inference machines
Learning erasing pattern languages with queries
Generalized logical consequence: Making room for induction in the logic of science
Inferring descriptive generalisations of formal languages
Learning deterministic regular grammars from stochastic samples in polynomial time
Learning semilinear sets from examples and via queries
Inference of even linear grammars and its application to picture description languages
A Stochastic Model of Language Change Through Social Structure and Prediction-Driven Instability
Machine learning of higher-order programs
A framework for polynomial-time query learnability
Aggregating inductive expertise on partial recursive functions
Languages as hyperplanes: grammatical inference with string kernels
Learning finite cover automata from queries
Iterative learning from texts and counterexamples using additional information
Computation as an unbounded process
Application of kolmogorov complexity to inductive inference with limited memory
The structure of intrinsic complexity of learning
The synthesis of language learners.
Learning languages in the limit from positive information with finitely many memory changes
On some open problems in reflective inductive inference
Co-learning of recursive languages from positive data
Logic and learning
Identification through Inductive Verification
Inductive synthesis of term rewriting systems
Variations on U-shaped learning
Recursion theoretic models of learning: Some results and intuitions
On a Question of Frank Stephan
Tracking probabilistic truths: a logic for statistical learning
On the complexity of learning programs
Discovering workflow nets of concurrent iterative processes
Finite identification from the viewpoint of epistemic update
Hypothesis spaces for learning
Teaching randomized learners with feedback
Intrinsic complexity of learning geometrical concepts from positive data
Trees and learning
Game semantics and the geometry of backtracking: a new complexity analysis of interaction
The efficiency of identifying timed automata and the power of clocks

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)