Inductive inference of formal languages from positive data

Cited in

(only showing first 100 items - show all)

Toward the interpretation of non-constructive reasoning as non-monotonic learning
Prescribed learning of r.e. classes
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
Bad news on decision problems for patterns
Synthesizing inductive expertise
Finding patterns common to a set of strings
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
On uniform learnability of language families
On the structural grammatical inference problem for some classes of context-free grammars
Learning semilinear sets from examples and via queries
Learning approximately regular languages with reversible languages
Investigations on measure-one identification of classes of languages
Is Gold-Putnam diagonalization complete?
On the equivalence problem for E-pattern languages
Recent advances of grammatical inference
Learning deterministic even linear languages from positive examples
Probabilistic language learning under monotonicity constraints
Noisy inference and oracles
Learning languages and functions by erasing
Some classes of Prolog programs inferable from positive data
Ordinal mind change complexity of language identification
Mind change complexity of learning logic programs
Learning pattern languages over groups
A theory of formal synthesis via inductive learning
On the teaching complexity of linear sets
Learnability of automatic classes
On learning unions of pattern languages and tree patterns in the mistake bound model.
On the power of incremental learning.
Learning classes of approximations to non-recursive functions.
The synthesis of language learners.
Incremental concept learning for bounded data mining.
The complexity of universal text-learners.
On a generalized notion of mistake bounds
Variants of iterative learning
Decision lists over regular patterns.
Refutable language learning with a neighbor system.
Polynomial-time identification of very simple grammars from positive data.
Learning power and language expressiveness.
PAC learning of probability distributions over a discrete domain.
Generalized notions of mind change complexity
Counting extensional differences in BC-learning
Learning figures with the Hausdorff metric by fractals -- towards computable binary classification
Learning block-preserving graph patterns and its application to data mining
Truth-tracking by belief revision
Automatic learning from positive data and negative counterexamples
Synthesizing context-free grammars from recurrent neural networks
On the amount of nonconstructivity in learning formal languages from text
Learning algorithms
Maps of restrictions for behaviourally correct learning
Mapping monotonic restrictions in inductive inference
Normal forms for semantically witness-based learners in inductive inference
Towards a map for incremental learning in the limit from positive and negative information
Learning languages in the limit from positive information with finitely many memory changes
Learnability and positive equivalence relations
Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data
On the hardness of learning queries from tree structured data
Book review of: Neil Tennant, Changes of mind. An essay on rational belief revision
A solution to Wiehagen's thesis
\(k\)-valued non-associative Lambek grammars are learnable from generalized functor-argument structures
On the data consumption benefits of accepting increased uncertainty
Learning tree languages from positive examples and membership queries
`Ideal learning' of natural language: positive results about learning from positive evidence
Results on memory-limited U-shaped learning
Formal language identification: query learning vs. gold-style learning
Intrinsic complexity of partial learning
Uncountable automatic classes and learning
Real time identification of discrete event systems using Petri nets
Some natural conditions on incremental learning
A general comparison of language learning from examples and from queries
Mind change efficient learning
Variations on U-shaped learning
Learning in varieties of the form \(\mathbf {V^{*}LI}\) from positive data
Inductive inference of approximations for recursive concepts
Relations between Gold-style learning and query learning
On the role of update constraints and text-types in iterative learning
Revisiting Shinohara's algorithm for computing descriptive patterns
Robust learning of automatic classes of languages
Automatic learners with feedback queries
Some independence results for control structures in complete numberings
Analyzing holistic parsers: Implications for robust parsing and systematicity
Classifying the arithmetical complexity of teaching models
Learning finite variants of single languages from informant
Intrinsic complexity of partial learning
Learning pattern languages over groups
Combining models of approximation with partial learning
On the Teaching Complexity of Linear Sets
Learning families of closed sets in matroids
Computability-theoretic learning complexity
Gold-style learning theory. A selection of highlights since Gold
Efficiency in the identification in the limit learning paradigm
On the Inference of Finite State Automata from Positive and Negative Data
Categorial dependency grammars with iterated sequences
Learning theory and epistemology

This page was built for publication: Inductive inference of formal languages from positive data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3910029)