Recommendations
Cites work
- scientific article; zbMATH DE number 4051031 (Why is no real title available?)
- scientific article; zbMATH DE number 67629 (Why is no real title available?)
- scientific article; zbMATH DE number 1966625 (Why is no real title available?)
- scientific article; zbMATH DE number 1379106 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 3806956 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3420728 (Why is no real title available?)
- Abelian squares are avoidable on 4 letters
- Avoidable patterns in strings of symbols
- Decision problems for patterns
- Finding patterns common to a set of strings
- Finite degrees of ambiguity in pattern languages
- Ignoring data may be the only way to learn efficiently
- Inductive inference of formal languages from positive data
- Language identification in the limit
- Learning Theory
- Pattern languages with and without erasing
- Polynomial-time inference of arbitrary pattern languages
- Research in the theory of inductive inference by GDR mathematicians - A survey
- STACS 2004
- The synthesis of language learners.
Cited in
(27)- Pattern matching with variables: a multivariate complexity analysis
- The unambiguity of segmented morphisms
- Unambiguous erasing morphisms in free monoids
- STACS 2004
- A note on the complexity of matching patterns with variables
- Intrinsic complexity of partial learning
- Patterns with bounded treewidth
- UNAMBIGUOUS MORPHIC IMAGES OF STRINGS
- Discontinuities in pattern inference
- Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory
- Weakly unambiguous morphisms
- Automatic learning of subclasses of pattern languages
- Bad News on Decision Problems for Patterns
- The complexity of verbal languages over groups
- Unambiguous Erasing Morphisms in Free Monoids
- Regular patterns, regular languages and context-free languages
- Learning indexed families of recursive languages from positive data: A survey
- Learning pattern languages over groups
- Inferring descriptive generalisations of formal languages
- Bad news on decision problems for patterns
- Finitely distinguishable erasing pattern languages
- Developments from enquiries into the learnability of the pattern languages from positive data
- Closure properties of pattern languages
- Closure properties of pattern languages
- Learning pattern languages over groups
- Learning concepts and their unions from positive data with refinement operators
- Learning Theory
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)
