Developments from enquiries into the learnability of the pattern languages from positive data

DOI10.1016/j.tcs.2008.02.028zbMath1145.68025OpenAlexW2166265158MaRDI QIDQ924175

Yen Kaow Ng, Takeshi Shinohara

Publication date: 28 May 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.02.028

zbMATH Keywords

inductive inferencepattern languagespositive datachronology

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45)

Related Items (17)

Fast learning of restricted regular expressions and dtds ⋮ A parameterized study of maximum generalized pattern matching problems ⋮ Inferring descriptive generalisations of formal languages ⋮ Regular and context-free pattern languages over small alphabets ⋮ Inclusion problems for patterns with a bounded number of variables ⋮ Bad News on Decision Problems for Patterns ⋮ A note on the complexity of matching patterns with variables ⋮ Learning indexed families of recursive languages from positive data: A survey ⋮ Set systems: order types, continuous nondeterministic deformations, and quasi-orders ⋮ Patterns with bounded treewidth ⋮ The unambiguity of segmented morphisms ⋮ Existence and nonexistence of descriptive patterns ⋮ Unnamed Item ⋮ Existence and Nonexistence of Descriptive Patterns ⋮ Unnamed Item ⋮ Bad news on decision problems for patterns ⋮ Pattern matching with variables: a multivariate complexity analysis

Uses Software

• PROSITE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inductive inference of monotonic formal systems from positive data
• Polynomial-time inference of arbitrary pattern languages
• From learning in the limit to stochastic finite learning
• A note on the two-variable pattern-finding problem
• Finding patterns common to a set of strings
• Learning elementary formal systems
• On the power of inductive inference from good examples
• Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time
• Rich classes inferable from positive data: Length-bounded elementary formal systems
• Simple splicing systems
• An average-case optimal one-variable pattern language learner
• Some classes of Prolog programs inferable from positive data
• Advanced elementary formal systems.
• Decision problems for patterns
• The theory of well-quasi-ordering: a frequently discovered concept
• Theory of Formal Systems. (AM-47)
• Inductive inference of formal languages from positive data
• Inference of Reversible Languages
• Ignoring data may be the only way to learn efficiently
• Learning Theory
• STACS 2004
• Algorithmic Learning Theory
• Algorithmic Learning Theory
• Algorithmic Learning Theory
• Algorithmic Learning Theory
• ELEMENTARY FORMAL SYSTEMS AND FORMAL LANGUAGES-SIMPLE FORMAL SYSTEMS
• Language identification in the limit
• Inductive inference of unbounded unions of pattern languages from positive data
• Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries

This page was built for publication: Developments from enquiries into the learnability of the pattern languages from positive data