Pages that link to "Item:Q1149795"
From MaRDI portal
The following pages link to Finding patterns common to a set of strings (Q1149795):
Displaying 50 items.
- Fast learning of restricted regular expressions and dtds (Q269337) (← links)
- A parameterized study of maximum generalized pattern matching problems (Q300450) (← links)
- Closure properties of pattern languages (Q340552) (← links)
- Inferring descriptive generalisations of formal languages (Q355503) (← links)
- Mind change speed-up for learning languages from positive data (Q388110) (← links)
- Regular and context-free pattern languages over small alphabets (Q391783) (← links)
- Iterative learning from texts and counterexamples using additional information (Q415613) (← links)
- Patterns with bounded treewidth (Q476169) (← links)
- Distributional learning of parallel multiple context-free grammars (Q479454) (← links)
- Separating sets of strings by finding matching patterns is almost always hard (Q507598) (← links)
- Learning concepts and their unions from positive data with refinement operators (Q513348) (← links)
- Hypothesis spaces for learning (Q553319) (← links)
- Monotonic and dual monotonic language learning (Q672148) (← links)
- Pattern systems (Q672745) (← links)
- Language learning without overgeneralization (Q673781) (← links)
- Multi-pattern languages (Q673787) (← links)
- Case-based representation and learning of pattern languages (Q674401) (← links)
- Three \(\sum^ P_ 2\)-complete problems in computational learning theory (Q685716) (← links)
- Automatic learning of subclasses of pattern languages (Q690501) (← links)
- Learning in the limit with lattice-structured hypothesis spaces (Q714848) (← links)
- Polynomial-time inference of arbitrary pattern languages (Q749229) (← links)
- Solutions principales et rang d'un système d'équations avec constantes dans le monoide libre (Q797700) (← links)
- Ordered term tree languages which are polynomial time inductively inferable from positive data (Q817835) (← links)
- A non-learnable class of E-pattern languages (Q817836) (← links)
- Blocksequences of \(k\)-local words (Q831795) (← links)
- Remarks on arbitrary multiple pattern interpretations (Q845932) (← links)
- From learning in the limit to stochastic finite learning (Q860825) (← links)
- Learning a subclass of regular patterns in polynomial time (Q860829) (← links)
- Developments from enquiries into the learnability of the pattern languages from positive data (Q924175) (← links)
- Discontinuities in pattern inference (Q924176) (← links)
- Learning indexed families of recursive languages from positive data: A survey (Q924177) (← links)
- Learning and extending sublanguages (Q924178) (← links)
- Learning in Friedberg numberings (Q939445) (← links)
- Existence and nonexistence of descriptive patterns (Q986561) (← links)
- Detecting patterns in finite regular and context-free languages (Q990125) (← links)
- U-shaped, iterative, and iterative-with-counter learning (Q1009263) (← links)
- On the closure of pattern expressions languages under intersection with regular languages (Q1015391) (← links)
- Learning efficiency of very simple grammars from positive data (Q1017659) (← links)
- Parallelism increases iterative learning power (Q1017664) (← links)
- Morphically primitive words (Q1019730) (← links)
- Necessary and sufficient conditions for learning with correction queries (Q1034636) (← links)
- On the language equivalence of NE star-patterns (Q1041796) (← links)
- Bad news on decision problems for patterns (Q1049406) (← links)
- Identification of pattern languages from examples and queries (Q1097709) (← links)
- A note on the two-variable pattern-finding problem (Q1097711) (← links)
- Learning regular languages from counterexamples (Q1176104) (← links)
- Learning in the presence of partial explanations (Q1183607) (← links)
- 2-testability and relabelings produce everything (Q1271607) (← links)
- A note on the equivalence problem of \(E\)-patterns (Q1351579) (← links)
- On the equivalence problem for E-pattern languages (Q1389770) (← links)
