Inductive inference of formal languages from positive data
From MaRDI portal
Publication:3910029
DOI10.1016/S0019-9958(80)90285-5zbMath0459.68051WikidataQ55881523 ScholiaQ55881523MaRDI QIDQ3910029
Publication date: 1980
Published in: Information and Control (Search for Journal in Brave)
Related Items (only showing first 100 items - show all)
Syntactic/semantic techniques in pattern recognition: A survey ⋮ A solution to Wiehagen's thesis ⋮ Learning Families of Closed Sets in Matroids ⋮ \(k\)-valued non-associative Lambek grammars are learnable from generalized functor-argument structures ⋮ On the classification of computable languages ⋮ The complexity of universal text-learners ⋮ Learning Actions Models: Qualitative Approach ⋮ Revisiting Shinohara's algorithm for computing descriptive patterns ⋮ On the data consumption benefits of accepting increased uncertainty ⋮ Learning tree languages from positive examples and membership queries ⋮ Robust learning of automatic classes of languages ⋮ Automatic learners with feedback 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 ⋮ Characterization of language learning front informant under various monotonicity constraints ⋮ Pattern languages with and without erasing ⋮ Computability-theoretic learning complexity ⋮ Intrinsic complexity of partial learning ⋮ Grammatical inference: An old and new paradigm ⋮ On approximately identifying concept classes in the limit ⋮ Language learnability in the limit: a generalization of Gold's theorem ⋮ Learning tree languages from text ⋮ Gold-Style Learning Theory ⋮ 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 ⋮ Uncountable automatic classes and learning ⋮ Prescribed Learning of R.E. Classes ⋮ Learning in Friedberg Numberings ⋮ One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples ⋮ Learning Theory and Epistemology ⋮ Unnamed Item ⋮ Real time identification of discrete event systems using Petri nets ⋮ Learning Left-to-Right and Right-to-Left Iterative Languages ⋮ Learning Bounded Unions of Noetherian Closed Set Systems Via Characteristic Sets ⋮ Iterative Learning of Simple External Contextual Languages ⋮ Topological Properties of Concept Spaces ⋮ Numberings Optimal for Learning ⋮ Bad News on Decision Problems for Patterns ⋮ Inclusion is undecidable for pattern languages ⋮ Learnability and positive equivalence relations ⋮ Some natural conditions on incremental learning ⋮ Some independence results for control structures in complete numberings ⋮ A general comparison of language learning from examples and from queries ⋮ Good Types Are Useful for Learning ⋮ Analyzing Holistic Parsers: Implications for Robust Parsing and Systematicity ⋮ The structure of intrinsic complexity of learning ⋮ Probabilistic language learning under monotonicity constraints ⋮ Noisy inference and oracles ⋮ Learning Lambek Grammars from Proof Frames ⋮ k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures ⋮ Robust learning with infinite additional information ⋮ On the learnability of recursively enumerable languages from good examples ⋮ Synthesizing noise-tolerant language learners ⋮ Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries ⋮ Synthesizing learners tolerating computable noisy data ⋮ Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data ⋮ Mind change efficient learning ⋮ Vacillatory and BC learning on noisy data ⋮ Inductive inference of unbounded unions of pattern languages from positive data ⋮ Variations on U-shaped learning ⋮ Learnability and positive equivalence relations ⋮ Learners based on transducers ⋮ Control structures in hypothesis spaces: The influence on learning ⋮ Learning algebraic structures from text ⋮ Aspects of complexity of probabilistic learning under monotonicity constraints ⋮ Learning in varieties of the form \(\mathbf {V^{*}LI}\) from positive data ⋮ Partial learning of recursively enumerable languages ⋮ Topological separations in inductive inference ⋮ Hypothesis Spaces for Learning ⋮ Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory ⋮ Language learning without overgeneralization ⋮ Learning correction grammars ⋮ Automatic Learners with Feedback Queries ⋮ Set-driven and rearrangement-independent learning of recursive languages ⋮ 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 ⋮ Difficulties in Forcing Fairness of Polynomial Time Inductive Inference ⋮ Uncountable Automatic Classes and Learning ⋮ Learning from Streams ⋮ Combining Models of Approximation with Partial Learning ⋮ On the Teaching Complexity of Linear Sets ⋮ MINIMAL CONCEPT IDENTIFICATION AND RELIABILITY ⋮ SIMPLE FLAT LANGUAGES: A LEARNABLE CLASS IN THE LIMIT FROM POSITIVE DATA ⋮ SOME SUFFICIENT CONDITIONS OF LEARNABILITY IN THE LIMIT FROM POSITIVE DATA ⋮ Logic and Learning ⋮ Inference of a class of CFPG by means of semantic rules ⋮ Induction and Exploitation of Subgoal Automata for Reinforcement Learning ⋮ Inductive inference of approximations for recursive concepts ⋮ Relations between Gold-style learning and query learning ⋮ On the hardness of learning queries from tree structured data ⋮ Book review of: Neil Tennant, Changes of mind. An essay on rational belief revision ⋮ Learning languages in the limit from positive information with finitely many memory changes ⋮ 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.
This page was built for publication: Inductive inference of formal languages from positive data
