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

DOI10.1016/J.TCS.2008.02.028MaRDI QIDQ924175zbMATH OpenOpenAlexFDO

Authors 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

chronologyinductive inferencepattern languagespositive data

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2149593
• Inductive inference of unbounded unions of pattern languages from positive data
• Inductive inference of unbounded unions of pattern languages from positive data
• A non-learnable class of E-pattern languages
• Identification of pattern languages from examples and queries

Cites work

• A note on the two-variable pattern-finding problem
• Advanced elementary formal systems.
• Algorithmic Learning Theory
• Algorithmic Learning Theory
• Algorithmic Learning Theory
• Algorithmic Learning Theory
• An average-case optimal one-variable pattern language learner
• Decision problems for patterns
• ELEMENTARY FORMAL SYSTEMS AND FORMAL LANGUAGES-SIMPLE FORMAL SYSTEMS
• Finding patterns common to a set of strings
• From learning in the limit to stochastic finite learning
• scientific article; zbMATH DE number 3868655 (Why is no real title available?)
• scientific article; zbMATH DE number 3817068 (Why is no real title available?)
• scientific article; zbMATH DE number 3956468 (Why is no real title available?)
• scientific article; zbMATH DE number 3982507 (Why is no real title available?)
• scientific article; zbMATH DE number 67629 (Why is no real title available?)
• scientific article; zbMATH DE number 3539202 (Why is no real title available?)
• scientific article; zbMATH DE number 408772 (Why is no real title available?)
• scientific article; zbMATH DE number 1301793 (Why is no real title available?)
• scientific article; zbMATH DE number 1322321 (Why is no real title available?)
• scientific article; zbMATH DE number 1351084 (Why is no real title available?)
• scientific article; zbMATH DE number 1351108 (Why is no real title available?)
• scientific article; zbMATH DE number 1104343 (Why is no real title available?)
• scientific article; zbMATH DE number 1142316 (Why is no real title available?)
• scientific article; zbMATH DE number 1966624 (Why is no real title available?)
• scientific article; zbMATH DE number 1966625 (Why is no real title available?)
• scientific article; zbMATH DE number 2077176 (Why is no real title available?)
• scientific article; zbMATH DE number 3806956 (Why is no real title available?)
• scientific article; zbMATH DE number 791077 (Why is no real title available?)
• scientific article; zbMATH DE number 1414302 (Why is no real title available?)
• scientific article; zbMATH DE number 3349329 (Why is no real title available?)
• Ignoring data may be the only way to learn efficiently
• Inductive inference of formal languages from positive data
• Inductive inference of monotonic formal systems from positive data
• Inductive inference of unbounded unions of pattern languages from positive data
• Inference of Reversible Languages
• Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time
• Language identification in the limit
• Learning elementary formal systems
• Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
• Learning Theory
• On the power of inductive inference from good examples
• Polynomial-time inference of arbitrary pattern languages
• Rich classes inferable from positive data: Length-bounded elementary formal systems
• Simple splicing systems
• Some classes of Prolog programs inferable from positive data
• STACS 2004
• The theory of well-quasi-ordering: a frequently discovered concept
• Theory of Formal Systems. (AM-47)

Cited in

(19)

• Bad news on decision problems for patterns
• Inclusion problems for patterns with a bounded number of variables
• Pattern matching with variables: a multivariate complexity analysis
• A note on the complexity of matching patterns with variables
• Fast learning of restricted regular expressions and dtds
• Bad News on Decision Problems for Patterns
• Inferring descriptive generalisations of formal languages
• Existence and Nonexistence of Descriptive Patterns
• Regular and context-free pattern languages over small alphabets
• Patterns with bounded treewidth
• Graph and string parameters: connections between pathwidth, cutwidth and the locality number
• scientific article; zbMATH DE number 7278096 (Why is no real title available?)
• Set systems: order types, continuous nondeterministic deformations, and quasi-orders
• Case-based representation and learning of pattern languages
• Hardness results for constant-free pattern languages and word equations
• Graph and string parameters: connections between pathwidth, cutwidth and the locality number
• Learning indexed families of recursive languages from positive data: A survey
• The unambiguity of segmented morphisms
• Existence and nonexistence of descriptive patterns

Describes a project that uses

Uses Software

• PROSITE

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q924175)