Finding patterns common to a set of strings
From MaRDI portal
Publication:1149795
DOI10.1016/0022-0000(80)90041-0zbMath0454.68108OpenAlexW1965415591WikidataQ56485132 ScholiaQ56485132MaRDI QIDQ1149795
Publication date: 1980
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(80)90041-0
Related Items (only showing first 100 items - show all)
Learning elementary formal systems with queries. ⋮ Refutable language learning with a neighbor system. ⋮ Fast learning of restricted regular expressions and dtds ⋮ Blocksequences of \(k\)-local words ⋮ A parameterized study of maximum generalized pattern matching problems ⋮ Invariance Properties of Quantifiers and Multiagent Information Exchange ⋮ Remarks on arbitrary multiple pattern interpretations ⋮ Identification of pattern languages from examples and queries ⋮ A note on the two-variable pattern-finding problem ⋮ A note on the equivalence problem of \(E\)-patterns ⋮ Revisiting Shinohara's algorithm for computing descriptive patterns ⋮ Automatic learners with feedback queries ⋮ Detecting morphic images of a word: On the rank of a pattern ⋮ Document spanners: from expressive power to decision problems ⋮ Closure properties of pattern languages ⋮ From learning in the limit to stochastic finite learning ⋮ Learning a subclass of regular patterns in polynomial time ⋮ Inferring descriptive generalisations of formal languages ⋮ Learning pattern languages over groups ⋮ Distinguishing pattern languages with membership examples ⋮ Regular patterns, regular languages and context-free languages ⋮ Mind change speed-up for learning languages from positive data ⋮ Regular and context-free pattern languages over small alphabets ⋮ Regular matching and inclusion on compressed tree patterns with constrained context variables ⋮ On the equivalence problem for E-pattern languages ⋮ Recent advances of grammatical inference ⋮ Learning unions of tree patterns using queries ⋮ Inclusion problems for patterns with a bounded number of variables ⋮ Intrinsic complexity of partial learning ⋮ Iterative learning from texts and counterexamples using additional information ⋮ Gold-Style Learning Theory ⋮ Efficiency in the Identification in the Limit Learning Paradigm ⋮ On the teaching complexity of linear sets ⋮ The complexity of verbal languages over groups ⋮ Learning block-preserving graph patterns and its application to data mining ⋮ A note on the complexity of matching patterns with variables ⋮ Developments from enquiries into the learnability of the pattern languages from positive data ⋮ Discontinuities in pattern inference ⋮ Learning indexed families of recursive languages from positive data: A survey ⋮ Learning and extending sublanguages ⋮ Patterns with bounded treewidth ⋮ Learning regular languages from counterexamples ⋮ Distributional learning of parallel multiple context-free grammars ⋮ Two-variable word equations ⋮ Learning in the presence of partial explanations ⋮ Learning in Friedberg numberings ⋮ Monotonic and dual monotonic language learning ⋮ Iterative learning from positive data and negative counterexamples ⋮ Pattern systems ⋮ Language learning without overgeneralization ⋮ Multi-pattern languages ⋮ Case-based representation and learning of pattern languages ⋮ Separating sets of strings by finding matching patterns is almost always hard ⋮ Learning concepts and their unions from positive data with refinement operators ⋮ Three \(\sum^ P_ 2\)-complete problems in computational learning theory ⋮ Automatic learning of subclasses of pattern languages ⋮ Learnability of automatic classes ⋮ Patterns in words and languages ⋮ Learning languages from positive data and a finite number of queries ⋮ Hypothesis spaces for learning ⋮ Automatic learning from positive data and negative counterexamples ⋮ Mind change efficient learning ⋮ Learning in the limit with lattice-structured hypothesis spaces ⋮ Existence and nonexistence of descriptive patterns ⋮ Detecting patterns in finite regular and context-free languages ⋮ Searching for Zimin patterns ⋮ Finitely distinguishable erasing pattern languages ⋮ A Polynomial Time Match Test for Large Classes of Extended Regular Expressions ⋮ U-shaped, iterative, and iterative-with-counter learning ⋮ On the amount of nonconstructivity in learning formal languages from text ⋮ On the closure of pattern expressions languages under intersection with regular languages ⋮ Polynomial-time inference of arbitrary pattern languages ⋮ Learning efficiency of very simple grammars from positive data ⋮ Parallelism increases iterative learning power ⋮ Morphically primitive words ⋮ Automatic Learners with Feedback Queries ⋮ 2-testability and relabelings produce everything ⋮ Learning Pattern Languages over Groups ⋮ An average-case optimal one-variable pattern language learner ⋮ Deterministic regular expressions with back-references ⋮ Necessary and sufficient conditions for learning with correction queries ⋮ Synchronized Regular Expressions ⋮ Ordinal mind change complexity of language identification ⋮ On the language equivalence of NE star-patterns ⋮ Bad news on decision problems for patterns ⋮ Solutions principales et rang d'un système d'équations avec constantes dans le monoide libre ⋮ 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 ⋮ Inductive inference of approximations for recursive concepts ⋮ Learning erasing pattern languages with queries ⋮ Pattern matching with variables: a multivariate complexity analysis ⋮ Mind change complexity of learning logic programs ⋮ Variants of iterative learning ⋮ A practical algorithm to find the best subsequence patterns ⋮ Discovering instances of poetic allusion from anthologies of classical Japanese poems ⋮ Ordered term tree languages which are polynomial time inductively inferable from positive data ⋮ A non-learnable class of E-pattern languages
Uses Software
Cites Work
This page was built for publication: Finding patterns common to a set of strings
