A non-learnable class of E-pattern languages
From MaRDI portal
Publication:817836
DOI10.1016/J.TCS.2005.10.017zbMATH Open1086.68116OpenAlexW2080895803MaRDI QIDQ817836FDOQ817836
Authors: Daniel Reidenbach 
Publication date: 20 March 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://figshare.com/articles/A_non-learnable_class_of_E-pattern_languages/9401876
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Computational learning theory (68Q32)
Cites Work
- Avoidable patterns in strings of symbols
- 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
- Finding patterns common to a set of strings
- Finite degrees of ambiguity in pattern languages
- Title not available (Why is that?)
- Pattern languages with and without erasing
- Abelian squares are avoidable on 4 letters
- Title not available (Why is that?)
- Decision problems for patterns
- Polynomial-time inference of arbitrary pattern languages
- Ignoring data may be the only way to learn efficiently
- Title not available (Why is that?)
- Title not available (Why is that?)
- Research in the theory of inductive inference by GDR mathematicians - A survey
- The synthesis of language learners.
- Title not available (Why is that?)
- Learning Theory
- Title not available (Why is that?)
- STACS 2004
Cited In (28)
- Unambiguous erasing morphisms in free monoids
- Automatic learning of subclasses of pattern languages
- The complexity of verbal languages over groups
- Pattern matching with variables: a multivariate complexity analysis
- Inferring descriptive generalisations of formal languages
- Learning indexed families of recursive languages from positive data: A survey
- Bad News on Decision Problems for Patterns
- Learning pattern languages over groups
- Developments from enquiries into the learnability of the pattern languages from positive data
- A parameterized study of maximum generalized pattern matching problems
- UNAMBIGUOUS MORPHIC IMAGES OF STRINGS
- Patterns with bounded treewidth
- Weakly unambiguous morphisms
- Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory
- Discontinuities in pattern inference
- The unambiguity of segmented morphisms
- Learning Theory
- Learning pattern languages over groups
- Intrinsic complexity of partial learning
- Closure properties of pattern languages
- Closure properties of pattern languages
- Finitely distinguishable erasing pattern languages
- Unambiguous Erasing Morphisms in Free Monoids
- Bad news on decision problems for patterns
- A note on the complexity of matching patterns with variables
- STACS 2004
- Learning concepts and their unions from positive data with refinement operators
- Regular patterns, regular languages and context-free languages
This page was built for publication: A non-learnable class of E-pattern languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817836)
