Language identification in the limit
From MaRDI portal
Publication:5674988
DOI10.1016/S0019-9958(67)91165-5zbMath0259.68032WikidataQ29013514 ScholiaQ29013514MaRDI QIDQ5674988
Publication date: 1967
Published in: Information and Control (Search for Journal in Brave)
Related Items (only showing first 100 items - show all)
Fast learning of restricted regular expressions and dtds ⋮ DKL: an efficient algorithm for learning deterministic Kripke structures ⋮ Inferring uniquely terminating regular languages from positive data ⋮ On inferring linear single-tree languages ⋮ How rich is the structure of the intrinsic complexity of learning ⋮ The unexpected applicability of paraconsistent logic: a Chomskyan route to dialetheism ⋮ The complexity of finding SUBSEQ\((A)\) ⋮ Minimal consistent DFA revisited ⋮ Inductive inference and reverse mathematics ⋮ A map of update constraints in inductive inference ⋮ Parallel learning of automatic classes of languages ⋮ Learning languages in a union ⋮ On the learnability of vector spaces ⋮ Strongly non-U-shaped language learning results by general techniques ⋮ Enlarging learnable classes ⋮ An approach to intrinsic complexity of uniform learning ⋮ On ordinal VC-dimension and some notions of complexity ⋮ From learning in the limit to stochastic finite learning ⋮ Learning of erasing primitive formal systems from positive examples ⋮ Learning a subclass of regular patterns in polynomial time ⋮ A model of language learning with semantics and meaning-preserving corrections ⋮ Inferring descriptive generalisations of formal languages ⋮ Learning all subfunctions of a function ⋮ Classes with easily learnable subclasses ⋮ On the classification of recursive languages ⋮ Learning of event-recording automata ⋮ Mind change speed-up for learning languages from positive data ⋮ Four one-shot learners for regular tree languages and their polynomial characterizability ⋮ Learning and classifying ⋮ Iterative learning from positive data and counters ⋮ Fluctuations, effective learnability and metastability in analysis ⋮ PAC learning, VC dimension, and the arithmetic hierarchy ⋮ Languages as hyperplanes: grammatical inference with string kernels ⋮ Learning finite cover automata from queries ⋮ Iterative learning from texts and counterexamples using additional information ⋮ Polynomial inference of universal automata from membership and equivalence queries ⋮ Computation as an unbounded process ⋮ A mathematical model of prediction-driven instability: how social structure can drive language change ⋮ Learning with ordinal-bounded memory from positive data ⋮ Polynomial characteristic sets for \(DFA\) identification ⋮ Categorial grammars with iterated types form a strict hierarchy of \(k\)-valued languages ⋮ Prudence and other conditions on formal language learning ⋮ Optimal language learning from positive data ⋮ Learning recursive functions: A survey ⋮ Reflective inductive inference of recursive functions ⋮ Quantum inductive inference by finite automata ⋮ Measuring teachability using variants of the teaching dimension ⋮ Some classes of term rewriting systems inferable from positive data ⋮ Developments from enquiries into the learnability of the pattern languages from positive data ⋮ Discontinuities in pattern inference ⋮ Learning indexed families of recursive languages from positive data: A survey ⋮ Learning and extending sublanguages ⋮ When unlearning helps ⋮ Confident and consistent partial learning of recursive functions ⋮ Non-U-shaped vacillatory and team learning ⋮ Learning languages from positive data and negative counterexamples ⋮ Probabilistic and team PFIN-type learning: General properties ⋮ Inferring answers to queries ⋮ Taming teams with mind changes ⋮ Learning with belief levels ⋮ Unscrambling the quantum omelette ⋮ A succinct canonical register automaton model ⋮ Distributional learning of parallel multiple context-free grammars ⋮ Learning in Friedberg numberings ⋮ Anomalous learning helps succinctness ⋮ Monotonic and dual monotonic language learning ⋮ A learning-theoretic characterization of classes of recursive functions ⋮ Language learning without overgeneralization ⋮ Training digraphs ⋮ On a question about learning nearly minimal programs ⋮ Case-based representation and learning of pattern languages ⋮ Towards a mathematical theory of machine discovery from facts ⋮ Characterizing language identification in terms of computable numberings ⋮ Learning concepts and their unions from positive data with refinement operators ⋮ Identification of probabilities ⋮ Solving divergence in Knuth--Bendix completion by enriching signatures ⋮ On the non-existence of maximal inference degrees for language identification ⋮ Automatic learning of subclasses of pattern languages ⋮ Teaching randomized learners with feedback ⋮ Finite identification from the viewpoint of epistemic update ⋮ Hypothesis spaces for learning ⋮ The efficiency of identifying timed automata and the power of clocks ⋮ On families of categorial grammars of bounded value, their learnability and related complexity questions ⋮ Learning in the limit with lattice-structured hypothesis spaces ⋮ Comparison of identification criteria for machine inductive inference ⋮ Resource restricted computability theoretic learning: Illustrative topics and problems ⋮ Input-dependence in function-learning ⋮ Quantified data automata for linear data structures: a register automaton model with applications to learning invariants of programs manipulating arrays and lists ⋮ Inductive inference of monotonic formal systems from positive data ⋮ Polynomial-time inference of arbitrary pattern languages ⋮ MAT learners for tree series: an abstract data type and two realizations ⋮ Inference of deterministic one-counter languages ⋮ Note on a central lemma for learning theory ⋮ On the inference of approximate programs ⋮ Training sequences ⋮ Learning via finitely many queries ⋮ ``Linear chaos via paradoxical set decompositions. ⋮ On the role of update constraints and text-types in iterative learning ⋮ A non-learnable class of E-pattern languages ⋮ Unifying logic, topology and learning in parametric logic
This page was built for publication: Language identification in the limit
