Finding patterns common to a set of strings
From MaRDI portal
Cites work
- 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?)
- Complexity of automaton identification from given data
- Fast Pattern Matching in Strings
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- Inductive inference of formal languages from positive data
Cited in
(only showing first 100 items - show all)- Language learning without overgeneralization
- An average-case optimal one-variable pattern language learner
- On a generalized notion of mistake bounds
- Matching patterns with variables under edit distance
- Identifying consensus of trees through alignment
- Three \(\sum^ P_ 2\)-complete problems in computational learning theory
- Automatic learning of subclasses of pattern languages
- Parallelism Increases Iterative Learning Power
- Set-driven and rearrangement-independent learning of recursive languages
- Learning Left-to-Right and Right-to-Left Iterative Languages
- The complexity of verbal languages over groups
- Distinguishing pattern languages with membership examples
- Blocksequences of \(k\)-local words
- Learning in the presence of partial explanations
- Learning a subclass of regular patterns in polynomial time
- Inferring regular languages by merging nonterminals
- Pattern matching with variables: a multivariate complexity analysis
- Learning languages from positive data and a finite number of queries
- Fast learning of restricted regular expressions and dtds
- Solutions principales et rang d'un système d'équations avec constantes dans le monoide libre
- A note on the two-variable pattern-finding problem
- A practical algorithm to find the best subsequence patterns
- Discovering instances of poetic allusion from anthologies of classical Japanese poems
- Learning erasing pattern languages with queries
- Inferring descriptive generalisations of formal languages
- A framework for polynomial-time query learnability
- Inductive synthesis of dot expressions
- Finding similar consensus between trees: An algorithm and a distance hierarchy
- Iterative learning from texts and counterexamples using additional information
- Finite degrees of ambiguity in pattern languages
- The structure of intrinsic complexity of learning
- The synthesis of language learners.
- Co-learning of recursive languages from positive data
- Inductive synthesis of term rewriting systems
- Remarks on arbitrary multiple pattern interpretations
- Learning Block-Preserving Outerplanar Graph Patterns and Its Application to Data Mining
- A note on the equivalence problem of \(E\)-patterns
- Hypothesis spaces for learning
- 2-testability and relabelings produce everything
- Two-variable word equations
- Learning indexed families of recursive languages from positive data: A survey
- U-shaped, iterative, and iterative-with-counter learning
- Monotonic and dual monotonic language learning
- Multi-pattern languages
- Learning efficiency of very simple grammars from positive data
- Learning in the limit with lattice-structured hypothesis spaces
- Patterns in words and languages
- Pattern languages with and without erasing
- Bad News on Decision Problems for Patterns
- Learning pattern languages over groups
- Invariance Properties of Quantifiers and Multiagent Information Exchange
- On the learnability of recursively enumerable languages from good examples
- Developments from enquiries into the learnability of the pattern languages from positive data
- Learning unions of tree patterns using queries
- Learning in Friedberg numberings
- Control structures in hypothesis spaces: The influence on learning
- Detecting patterns in finite regular and context-free languages
- Existence and nonexistence of descriptive patterns
- Gold-style learning theory. A selection of highlights since Gold
- Efficiency in the identification in the limit learning paradigm
- Learning Lambek grammars from proof frames
- Learning unions of tree patterns using queries
- Parsimony hierarchies for inductive inference
- Detecting morphic images of a word: On the rank of a pattern
- Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
- Graph and string parameters: connections between pathwidth, cutwidth and the locality number
- Patterns with bounded treewidth
- UNAMBIGUOUS MORPHIC IMAGES OF STRINGS
- Mind change efficient learning
- From learning in the limit to stochastic finite learning
- On the power of incremental learning.
- Variants of iterative learning
- Discovering unbounded unions of regular pattern languages from positive examples
- Synchronized regular expressions
- Minimal concept identification and reliability
- A non-learnable class of E-pattern languages
- On the closure of pattern expressions languages under intersection with regular languages
- Discontinuities in pattern inference
- Document spanners: from expressive power to decision problems
- Revisiting Shinohara's algorithm for computing descriptive patterns
- On the structure of solution-sets to regular word equations
- On learning unions of pattern languages and tree patterns in the mistake bound model.
- Inclusion problems for patterns with a bounded number of variables
- Distributional learning of parallel multiple context-free grammars
- Matching patterns with variables under Simon's congruence
- Automatic Learners with Feedback Queries
- Recent advances of grammatical inference
- Ignoring data may be the only way to learn efficiently
- Learning pattern languages over groups
- On the equivalence problem for E-pattern languages
- Ordinal mind change complexity of language identification
- On the amount of nonconstructivity in learning formal languages from text
- Intrinsic complexity of partial learning
- Closure properties of pattern languages
- Regular and context-free pattern languages over small alphabets
- Iterative learning from positive data and negative counterexamples
- Languages generated by conjunctive query fragments of FC[REG]
- Searching for Zimin patterns
- Learning in Friedberg Numberings
- On the language equivalence of NE star-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)
