Inferring descriptive generalisations of formal languages

DOI10.1016/J.JCSS.2012.10.001zbMath1285.68073OpenAlexW2017477222MaRDI QIDQ355503

Dominik D. Freydenberger, Daniel Reidenbach

Publication date: 24 July 2013

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2012.10.001

zbMATH Keywords

inductive inferencepattern languagesdescriptive generalisationdescriptive patternsupper approximate identification from positive data

Mathematics Subject Classification ID

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

Related Items (5)

Fast learning of restricted regular expressions and dtds ⋮ Revisiting Shinohara's algorithm for computing descriptive patterns ⋮ Inferring descriptive generalisations of formal languages ⋮ Distinguishing pattern languages with membership examples ⋮ Unnamed Item

Cites Work

• Fast learning of restricted regular expressions and dtds
• Inferring descriptive generalisations of formal languages
• Finding a homomorphism between two words is NP-complete
• Polynomial-time inference of arbitrary pattern languages
• A non-learnable class of E-pattern languages
• 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
• Existence and nonexistence of descriptive patterns
• Morphically primitive words
• Polynomial-time algorithm for fixed points of nontrivial morphisms
• Bad news on decision problems for patterns
• Finding patterns common to a set of strings
• Learning approximately regular languages with reversible languages
• Learning in the presence of inaccurate information
• Identification of function distinguishable languages.
• An average-case optimal one-variable pattern language learner
• Decision problems for patterns
• Uncountable Automatic Classes and Learning
• Inductive inference of formal languages from positive data
• Ignoring data may be the only way to learn efficiently
• Pattern languages with and without erasing
• Language identification in the limit
• A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Inferring descriptive generalisations of formal languages