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.
- Recent advances of grammatical inference (Q1390941) (← links)
- Learning unions of tree patterns using queries (Q1390942) (← links)
- An average-case optimal one-variable pattern language learner (Q1567401) (← links)
- Ordinal mind change complexity of language identification (Q1575840) (← links)
- Mind change complexity of learning logic programs (Q1603595) (← links)
- Document spanners: from expressive power to decision problems (Q1650917) (← links)
- Learning pattern languages over groups (Q1663643) (← links)
- Regular patterns, regular languages and context-free languages (Q1675877) (← links)
- On the teaching complexity of linear sets (Q1704564) (← links)
- The complexity of verbal languages over groups (Q1713480) (← links)
- Learnability of automatic classes (Q1757849) (← links)
- Patterns in words and languages (Q1765231) (← links)
- On learning unions of pattern languages and tree patterns in the mistake bound model. (Q1853515) (← links)
- On the power of incremental learning. (Q1853517) (← links)
- The synthesis of language learners. (Q1854290) (← links)
- Incremental concept learning for bounded data mining. (Q1854293) (← links)
- On a generalized notion of mistake bounds (Q1854426) (← links)
- Variants of iterative learning (Q1870531) (← links)
- A practical algorithm to find the best subsequence patterns (Q1870541) (← links)
- Discovering instances of poetic allusion from anthologies of classical Japanese poems (Q1870547) (← links)
- Learning elementary formal systems with queries. (Q1874227) (← links)
- Refutable language learning with a neighbor system. (Q1874230) (← links)
- Detecting morphic images of a word: On the rank of a pattern (Q1899100) (← links)
- Inclusion problems for patterns with a bounded number of variables (Q1932172) (← links)
- Learning block-preserving graph patterns and its application to data mining (Q1959502) (← links)
- Automatic learning from positive data and negative counterexamples (Q2013555) (← links)
- On the amount of nonconstructivity in learning formal languages from text (Q2051759) (← links)
- Finitely distinguishable erasing pattern languages (Q2290682) (← links)
- Deterministic regular expressions with back-references (Q2316926) (← 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)
- Iterative learning from positive data and negative counterexamples (Q2464142) (← links)
- Learning languages from positive data and a finite number of queries (Q2490120) (← links)
- Mind change efficient learning (Q2496299) (← links)
- Searching for Zimin patterns (Q2512657) (← links)
- Inductive inference of approximations for recursive concepts (Q2581360) (← links)
- Learning erasing pattern languages with queries (Q2581361) (← links)
- Revisiting Shinohara's algorithm for computing descriptive patterns (Q2636407) (← links)
- Automatic learners with feedback queries (Q2637649) (← links)
- Regular matching and inclusion on compressed tree patterns with constrained context variables (Q2672652) (← links)
- Two-variable word equations (Q2729626) (← links)
- Learning Pattern Languages over Groups (Q2830276) (← links)
- Synchronized regular expressions (Q2841278) (← links)
- Gold-Style Learning Theory (Q2963592) (← links)
- Efficiency in the Identification in the Limit Learning Paradigm (Q2963593) (← links)
- A Polynomial Time Match Test for Large Classes of Extended Regular Expressions (Q3073643) (← links)
- Automatic Learners with Feedback Queries (Q3091438) (← links)
- Invariance Properties of Quantifiers and Multiagent Information Exchange (Q3172828) (← links)
