Discontinuities in pattern inference
From MaRDI portal
Publication:924176
DOI10.1016/J.TCS.2008.02.029zbMATH Open1145.68027OpenAlexW1970263043MaRDI QIDQ924176FDOQ924176
Authors: Daniel Reidenbach 
Publication date: 28 May 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://figshare.com/articles/Discontinuities_in_pattern_inference/9401606
Recommendations
Formal languages and automata (68Q45) Computational learning theory (68Q32) Combinatorics on words (68R15)
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
- Finding patterns common to a set of strings
- Stochastic finite learning of the pattern languages
- Title not available (Why is that?)
- Finite degrees of ambiguity in pattern languages
- Title not available (Why is that?)
- Pattern languages with and without erasing
- UNAMBIGUOUS MORPHIC IMAGES OF STRINGS
- Finding a homomorphism between two words is NP-complete
- A non-learnable class of E-pattern languages
- Title not available (Why is that?)
- Decision problems for patterns
- An examination of Ohlebusch and Ukkonen's conjecture on the equivalence problem for E-pattern languages
- Polynomial-time inference of arbitrary pattern languages
- An average-case optimal one-variable pattern language learner
- Ignoring data may be the only way to learn efficiently
- Formal language identification: query learning vs. gold-style learning
- Relations between Gold-style learning and query learning
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fixed languages and the adult languages of ol schemest†
- The synthesis of language learners.
- Learning Theory
- STACS 2004
- On the equivalence problem for E-pattern languages
- Strongly prime PCP words
- Developments in Language Theory
Cited In (27)
- Unambiguous erasing morphisms in free monoids
- Ambiguity of Morphisms in a Free Group
- Pattern matching with variables: a multivariate complexity analysis
- Inferring descriptive generalisations of formal languages
- Unambiguous injective morphisms in free groups
- Learning indexed families of recursive languages from positive data: A survey
- Bad News on Decision Problems for Patterns
- A parameterized study of maximum generalized pattern matching problems
- Patterns with bounded treewidth
- Weakly unambiguous morphisms
- Restricted ambiguity of erasing morphisms
- A non-learnable class of E-pattern languages
- The unambiguity of segmented morphisms
- Learning Theory
- The Billaud conjecture for \(|\varSigma| = 4\), and beyond
- On Billaud words and their companions
- On Billaud words and their companions
- Closure properties of pattern languages
- Regular and context-free pattern languages over small alphabets
- 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
- Morphically primitive words
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Discontinuities in pattern inference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q924176)
