Finding patterns common to a set of strings
From MaRDI portal
Cites work
- Complexity of automaton identification from given data
- Fast Pattern Matching in Strings
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- scientific article; zbMATH DE number 3590511 (Why is no real title available?)
- scientific article; zbMATH DE number 3449757 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- scientific article; zbMATH DE number 3032896 (Why is no real title available?)
- Inductive inference of formal languages from positive data
Cited in
(only showing first 100 items - show all)- U-shaped, iterative, and iterative-with-counter learning
- On the closure of pattern expressions languages under intersection with regular languages
- Learning efficiency of very simple grammars from positive data
- Parallelism increases iterative learning power
- Morphically primitive words
- Necessary and sufficient conditions for learning with correction queries
- On the language equivalence of NE star-patterns
- Bad news on decision problems for patterns
- Identification of pattern languages from examples and queries
- A note on the two-variable pattern-finding problem
- Learning regular languages from counterexamples
- Learning in the presence of partial explanations
- 2-testability and relabelings produce everything
- A note on the equivalence problem of \(E\)-patterns
- On the equivalence problem for E-pattern languages
- Recent advances of grammatical inference
- Learning unions of tree patterns using queries
- An average-case optimal one-variable pattern language learner
- Ordinal mind change complexity of language identification
- Mind change complexity of learning logic programs
- Document spanners: from expressive power to decision problems
- Learning pattern languages over groups
- Regular patterns, regular languages and context-free languages
- On the teaching complexity of linear sets
- The complexity of verbal languages over groups
- Learnability of automatic classes
- Patterns in words and languages
- On learning unions of pattern languages and tree patterns in the mistake bound model.
- On the power of incremental learning.
- The synthesis of language learners.
- Incremental concept learning for bounded data mining.
- On a generalized notion of mistake bounds
- Variants of iterative learning
- A practical algorithm to find the best subsequence patterns
- Discovering instances of poetic allusion from anthologies of classical Japanese poems
- Learning elementary formal systems with queries.
- Refutable language learning with a neighbor system.
- Detecting morphic images of a word: On the rank of a pattern
- Inclusion problems for patterns with a bounded number of variables
- Learning block-preserving graph patterns and its application to data mining
- Automatic learning from positive data and negative counterexamples
- On the amount of nonconstructivity in learning formal languages from text
- Finitely distinguishable erasing pattern languages
- Deterministic regular expressions with back-references
- Pattern matching with variables: a multivariate complexity analysis
- Distinguishing pattern languages with membership examples
- Intrinsic complexity of partial learning
- A note on the complexity of matching patterns with variables
- Iterative learning from positive data and negative counterexamples
- Learning languages from positive data and a finite number of queries
- Mind change efficient learning
- Searching for Zimin patterns
- Inductive inference of approximations for recursive concepts
- Learning erasing pattern languages with queries
- Revisiting Shinohara's algorithm for computing descriptive patterns
- Automatic learners with feedback queries
- Regular matching and inclusion on compressed tree patterns with constrained context variables
- Fast learning of restricted regular expressions and dtds
- Two-variable word equations
- Learning pattern languages over groups
- Synchronized regular expressions
- Gold-style learning theory. A selection of highlights since Gold
- Efficiency in the identification in the limit learning paradigm
- A polynomial time match test for large classes of extended regular expressions
- Automatic Learners with Feedback Queries
- Invariance Properties of Quantifiers and Multiagent Information Exchange
- Closure properties of pattern languages
- Parallelism Increases Iterative Learning Power
- Learning in Friedberg Numberings
- Learning Efficiency of Very Simple Grammars from Positive Data
- Learning Left-to-Right and Right-to-Left Iterative Languages
- Bad News on Decision Problems for Patterns
- Learning Block-Preserving Outerplanar Graph Patterns and Its Application to Data Mining
- Inferring descriptive generalisations of formal languages
- Hypothesis Spaces for Learning
- Existence and Nonexistence of Descriptive Patterns
- Iterative Learning from Texts and Counterexamples Using Additional Information
- Mind change speed-up for learning languages from positive data
- Regular and context-free pattern languages over small alphabets
- Iterative learning from texts and counterexamples using additional information
- Inferring regular languages by merging nonterminals
- Ignoring data may be the only way to learn efficiently
- A framework for polynomial-time query learnability
- Detecting the morphic images of a word : improving the general algorithm
- Fair expressions and regular languages over lists
- Finite degrees of ambiguity in pattern languages
- The structure of intrinsic complexity of learning
- Inductive synthesis of dot expressions
- Inductive synthesis of term rewriting systems
- Inclusion is undecidable for pattern languages
- Set-driven and rearrangement-independent learning of recursive languages
- Patterns with bounded treewidth
- Distributional learning of parallel multiple context-free grammars
- Pattern languages with and without erasing
- Separating sets of strings by finding matching patterns is almost always hard
- Graph and string parameters: connections between pathwidth, cutwidth and the locality number
- Language learning without overgeneralization
- Learning concepts and their unions from positive data with refinement operators
- scientific article; zbMATH DE number 7278096 (Why is no real title available?)
- Detecting one-variable patterns
This page was built for publication: Finding patterns common to a set of strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1149795)
