The following pages link to (Q4749224):
Displaying 42 items.
- A parameterized study of maximum generalized pattern matching problems (Q300450) (← links)
- Inferring descriptive generalisations of formal languages (Q355503) (← links)
- Regular and context-free pattern languages over small alphabets (Q391783) (← links)
- Patterns with bounded treewidth (Q476169) (← links)
- Monotonic and dual monotonic language learning (Q672148) (← links)
- A machine discovery from amino acid sequences by decision trees over regular patterns (Q688817) (← links)
- Automatic learning of subclasses of pattern languages (Q690501) (← links)
- Inductive inference of monotonic formal systems from positive data (Q749217) (← 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)
- Learning of erasing primitive formal systems from positive examples (Q860828) (← 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)
- Existence and nonexistence of descriptive patterns (Q986561) (← links)
- Necessary and sufficient conditions for learning with correction queries (Q1034636) (← links)
- Learning elementary formal systems (Q1186429) (← links)
- Probabilistic language learning under monotonicity constraints (Q1390945) (← links)
- Learning pattern languages over groups (Q1663643) (← links)
- Regular patterns, regular languages and context-free languages (Q1675877) (← links)
- On learning unions of pattern languages and tree patterns in the mistake bound model. (Q1853515) (← links)
- A practical algorithm to find the best subsequence patterns (Q1870541) (← links)
- Learning elementary formal systems with queries. (Q1874227) (← links)
- Decision lists over regular patterns. (Q1874229) (← links)
- Inclusion problems for patterns with a bounded number of variables (Q1932172) (← links)
- Finitely distinguishable erasing pattern languages (Q2290682) (← links)
- Pattern matching with variables: a multivariate complexity analysis (Q2346415) (← links)
- Distinguishing pattern languages with membership examples (Q2407113) (← links)
- Intrinsic complexity of partial learning (Q2419119) (← links)
- A note on the complexity of matching patterns with variables (Q2445237) (← links)
- Some natural conditions on incremental learning (Q2461797) (← links)
- Learning erasing pattern languages with queries (Q2581361) (← links)
- Revisiting Shinohara's algorithm for computing descriptive patterns (Q2636407) (← links)
- Bad News on Decision Problems for Patterns (Q3533022) (← links)
- Learning Block-Preserving Outerplanar Graph Patterns and Its Application to Data Mining (Q3543283) (← links)
- Inductive inference of unbounded unions of pattern languages from positive data (Q5915396) (← links)
- Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries (Q5941371) (← links)
- Discovering unbounded unions of regular pattern languages from positive examples (Q6487429) (← links)
- Co-learning of recursive languages from positive data (Q6570930) (← links)
- Languages generated by conjunctive query fragments of FC[REG] (Q6661764) (← links)
- The equivalence problem of E-pattern languages with regular constraints is undecidable (Q6666804) (← links)
