Inferring descriptive generalisations of formal languages
From MaRDI portal
Publication:355503
DOI10.1016/J.JCSS.2012.10.001zbMATH Open1285.68073OpenAlexW2017477222MaRDI QIDQ355503FDOQ355503
Authors: 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
Recommendations
inductive inferencepattern languagesdescriptive generalisationdescriptive patternsupper approximate identification from positive data
Cites Work
- Title not available (Why is that?)
- Inductive inference of formal languages from positive data
- Title not available (Why is that?)
- Language identification in the limit
- Learning indexed families of recursive languages from positive data: A survey
- Finding patterns common to a set of strings
- Fast learning of restricted regular expressions and dtds
- Inferring descriptive generalisations of formal languages
- Developments from enquiries into the learnability of the pattern languages from positive data
- Existence and nonexistence of descriptive patterns
- Title not available (Why is that?)
- Pattern languages with and without erasing
- Finding a homomorphism between two words is NP-complete
- A non-learnable class of E-pattern languages
- Discontinuities in pattern inference
- A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS
- Bad news on decision problems for patterns
- Decision problems for patterns
- Polynomial-time inference of arbitrary pattern languages
- Morphically primitive words
- Polynomial-time algorithm for fixed points of nontrivial morphisms
- 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
- Uncountable automatic classes and learning
- Ignoring data may be the only way to learn efficiently
- Title not available (Why is that?)
- Title not available (Why is that?)
- Learning and extending sublanguages
Cited In (9)
- Distinguishing pattern languages with membership examples
- Fast learning of restricted regular expressions and dtds
- Inferring descriptive generalisations of formal languages
- Implications between generative properties and analytical properties of formal languages
- Toward complete programming language descriptions that are both formal and understandable
- Revisiting Shinohara's algorithm for computing descriptive patterns
- Title not available (Why is that?)
- Representing structural language features in formal meta-languages
- Title not available (Why is that?)
This page was built for publication: Inferring descriptive generalisations of formal languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q355503)
