Inductive inference of formal languages from positive data

Cited in

(only showing first 100 items - show all)

Learning and classifying
Language learning without overgeneralization
On a generalized notion of mistake bounds
The complexity of universal text-learners.
Automatic learning of subclasses of pattern languages
Robust learning of automatic classes of languages
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
Maps of restrictions for behaviourally correct learning
Normal forms for semantically witness-based learners in inductive inference
Learning in the presence of partial explanations
Noisy inference and oracles
One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples
Investigations on measure-one identification of classes of languages
Syntactic/semantic techniques in pattern recognition: A survey
Numberings optimal for learning
Analyzing holistic parsers: Implications for robust parsing and systematicity
Decision lists over regular patterns.
Learning power and language expressiveness.
Inferring descriptive generalisations of formal languages
Learning semilinear sets from examples and via queries
On the Teaching Complexity of Linear Sets
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
Co-learning of recursive languages from positive data
Logic and learning
Variations on U-shaped learning
Hypothesis spaces for learning
Learning indexed families of recursive languages from positive data: A survey
When unlearning helps
Monotonic and dual monotonic language learning
Aspects of complexity of probabilistic learning under monotonicity constraints
Incremental learning of approximations from positive data
Truth-tracking by belief revision
Incremental learning with temporary memory
Iterative learning of simple external contextual languages
Learnability and positive equivalence relations
On families of categorial grammars of bounded value, their learnability and related complexity questions
Learning in the limit with lattice-structured hypothesis spaces
On the hardness of learning queries from tree structured data
Computability-theoretic learning complexity
Uncountable automatic classes and learning
Pattern languages with and without erasing
On the solvability of inductive problems: a study in epistemic topology
Counting extensional differences in BC-learning
Bad News on Decision Problems for Patterns
Learning pattern languages over groups
A theory of formal synthesis via inductive learning
On the learnability of recursively enumerable languages from good examples
Developments from enquiries into the learnability of the pattern languages from positive data
Learning in Friedberg numberings
Control structures in hypothesis spaces: The influence on learning
On some open problems in monotonic and conservative learning
On approximately identifying concept classes in the limit
On the classification of computable languages
Prescribed learning of r.e. classes
Gold-style learning theory. A selection of highlights since Gold
Efficiency in the identification in the limit learning paradigm
Categorial dependency grammars with iterated sequences
Book review of: Neil Tennant, Changes of mind. An essay on rational belief revision
Bridging learning theory and dynamic epistemic logic
Learning of erasing primitive formal systems from positive examples
On ordinal VC-dimension and some notions of complexity
Learning Lambek grammars from proof frames
Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
Learning algebraic structures from text
Finding patterns common to a set of strings
Learning theory and epistemology
`Ideal learning' of natural language: positive results about learning from positive evidence
Synthesizing inductive expertise
Input-dependence in function-learning
Inductive inference from all positive and some negative data
Learning all subfunctions of a function
Learning correction grammars
On uniform learnability of language families
Mind change efficient learning
From learning in the limit to stochastic finite learning
On the power of incremental learning.
Variants of iterative learning
Learning tree languages from positive examples and membership queries
Minimal concept identification and reliability
Formal language identification: query learning vs. gold-style learning
A non-learnable class of E-pattern languages
A solution to Wiehagen's thesis
\(k\)-valued non-associative Lambek grammars are learnable from generalized functor-argument structures
Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory
Learning finite variants of single languages from informant
Uncountable automatic classes and learning
Discontinuities in pattern inference
Relations between Gold-style learning and query learning
Prescribed Learning of R.E. Classes
Notes on my scientific life
Learning to act and observe in partially observable domains
Revisiting Shinohara's algorithm for computing descriptive patterns
Polynomial-time identification of very simple grammars from positive data.
Secretive interaction. Players and strategies
Inductive inference of monotonic formal systems from positive data
\(K\)-valued non-associative Lambek grammars are learnable from function-argument structures

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)