Discontinuities in pattern inference
From MaRDI portal
Publication:924176
DOI10.1016/J.TCS.2008.02.029zbMATH Open1145.68027OpenAlexW1970263043MaRDI QIDQ924176FDOQ924176
Recommendations
Cites work
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- 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 3590511 (Why is no real title available?)
- scientific article; zbMATH DE number 2150289 (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?)
- A non-learnable class of E-pattern languages
- An average-case optimal one-variable pattern language learner
- An examination of Ohlebusch and Ukkonen's conjecture on the equivalence problem for E-pattern languages
- Decision problems for patterns
- Developments in Language Theory
- Finding a homomorphism between two words is NP-complete
- Finding patterns common to a set of strings
- Finite degrees of ambiguity in pattern languages
- Fixed languages and the adult languages of ol schemest†
- Formal language identification: query learning vs. gold-style learning
- 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
- On the equivalence problem for E-pattern languages
- Pattern languages with and without erasing
- Polynomial-time inference of arbitrary pattern languages
- Relations between Gold-style learning and query learning
- STACS 2004
- Stochastic finite learning of the pattern languages
- Strongly prime PCP words
- The synthesis of language learners.
- UNAMBIGUOUS MORPHIC IMAGES OF STRINGS
Cited in
(26)- Pattern matching with variables: a multivariate complexity analysis
- The Billaud conjecture for \(|\varSigma| = 4\), and beyond
- The unambiguity of segmented morphisms
- Unambiguous erasing morphisms in free monoids
- STACS 2004
- A note on the complexity of matching patterns with variables
- Regular and context-free pattern languages over small alphabets
- Graph and string parameters: connections between pathwidth, cutwidth and the locality number
- Patterns with bounded treewidth
- Restricted ambiguity of erasing morphisms
- Weakly unambiguous morphisms
- Bad News on Decision Problems for Patterns
- Unambiguous injective morphisms in free groups
- Unambiguous Erasing Morphisms in Free Monoids
- A non-learnable class of E-pattern languages
- Learning indexed families of recursive languages from positive data: A survey
- scientific article; zbMATH DE number 7278096 (Why is no real title available?)
- Inferring descriptive generalisations of formal languages
- Bad news on decision problems for patterns
- Finitely distinguishable erasing pattern languages
- Ambiguity of morphisms in a free group
- Closure properties of pattern languages
- Learning Theory
- Morphically primitive words
- On Billaud words and their companions
- On Billaud words and their companions
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)
