scientific article; zbMATH DE number 3806956
From MaRDI portal
Publication:4749224
zbMath0511.68050MaRDI QIDQ4749224
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Learning elementary formal systems with queries., Decision lists over regular patterns., A parameterized study of maximum generalized pattern matching problems, Revisiting Shinohara's algorithm for computing descriptive patterns, Learning of erasing primitive formal systems from positive examples, Learning a subclass of regular patterns in polynomial time, Inferring descriptive generalisations of formal languages, Learning pattern languages over groups, Distinguishing pattern languages with membership examples, Regular patterns, regular languages and context-free languages, Regular and context-free pattern languages over small alphabets, Probabilistic language learning under monotonicity constraints, Inclusion problems for patterns with a bounded number of variables, Intrinsic complexity of partial learning, Languages generated by conjunctive query fragments of FC[REG], Learning picture sets from examples, Bad News on Decision Problems for Patterns, A note on the complexity of matching patterns with variables, 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 Block-Preserving Outerplanar Graph Patterns and Its Application to Data Mining, Patterns with bounded treewidth, Some natural conditions on incremental learning, Learning elementary formal systems, Monotonic and dual monotonic language learning, A machine discovery from amino acid sequences by decision trees over regular patterns, Automatic learning of subclasses of pattern languages, Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries, Inductive inference of unbounded unions of pattern languages from positive data, Existence and nonexistence of descriptive patterns, Finitely distinguishable erasing pattern languages, Inductive inference of monotonic formal systems from positive data, Necessary and sufficient conditions for learning with correction queries, On learning unions of pattern languages and tree patterns in the mistake bound model., Learning erasing pattern languages with queries, Pattern matching with variables: a multivariate complexity analysis, A practical algorithm to find the best subsequence patterns, Ordered term tree languages which are polynomial time inductively inferable from positive data, A non-learnable class of E-pattern languages
