Publication:1149795

DOI10.1016/0022-0000(80)90041-0zbMATH Open0454.68108OpenAlexW1965415591WikidataQ56485132 ScholiaQ56485132MaRDI QIDQ1149795FDOQ1149795

Dana Angluin

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

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Artificial intelligence (68T99)

Cites Work

• Inductive inference of formal languages from positive data
• Fast Pattern Matching in Strings
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• Complexity of automaton identification from given data
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Identifying consensus of trees through alignment
• An average-case optimal one-variable pattern language learner
• Set-driven and rearrangement-independent learning of recursive languages
• Three \(\sum^ P_ 2\)-complete problems in computational learning theory
• Automatic learning of subclasses of pattern languages
• The complexity of verbal languages over groups
• A Polynomial Time Match Test for Large Classes of Extended Regular Expressions
• Learning a subclass of regular patterns in polynomial time
• Learning in the presence of partial explanations
• Pattern matching with variables: a multivariate complexity analysis
• Fast learning of restricted regular expressions and dtds
• Finding similar consensus between trees: An algorithm and a distance hierarchy
• A framework for polynomial-time query learnability
• A note on the two-variable pattern-finding problem
• Solutions principales et rang d'un système d'équations avec constantes dans le monoide libre
• Finite degrees of ambiguity in pattern languages
• The structure of intrinsic complexity of learning
• Inferring descriptive generalisations of formal languages
• The synthesis of language learners.
• Iterative learning from texts and counterexamples using additional information
• A note on the equivalence problem of \(E\)-patterns
• Two-variable word equations
• Hypothesis spaces for learning
• 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
• Pattern languages with and without erasing
• Learning in the limit with lattice-structured hypothesis spaces
• Patterns in words and languages
• On the learnability of recursively enumerable languages from good examples
• Control structures in hypothesis spaces: The influence on learning
• Invariance Properties of Quantifiers and Multiagent Information Exchange
• Developments from enquiries into the learnability of the pattern languages from positive data
• Learning in Friedberg numberings
• Parsimony hierarchies for inductive inference
• Existence and nonexistence of descriptive patterns
• A parameterized study of maximum generalized pattern matching problems
• UNAMBIGUOUS MORPHIC IMAGES OF STRINGS
• Patterns with bounded treewidth
• Mind change efficient learning
• On the power of incremental learning.
• Variants of iterative learning
• From learning in the limit to stochastic finite learning
• A non-learnable class of E-pattern languages
• Discontinuities in pattern inference
• Learning Pattern Languages over Groups
• Distributional learning of parallel multiple context-free grammars
• Automatic Learners with Feedback Queries
• Ignoring data may be the only way to learn efficiently
• Recent advances of grammatical inference
• Ordinal mind change complexity of language identification
• Closure properties of pattern languages
• Iterative learning from positive data and negative counterexamples
• Regular and context-free pattern languages over small alphabets
• Grammatical inference: An old and new paradigm
• Polynomial-time inference of arbitrary pattern languages
• Inclusion is undecidable for pattern languages
• Bad news on decision problems for patterns
• Parallelism increases iterative learning power
• Identification of pattern languages from examples and queries
• Learnability of automatic classes
• A note on the complexity of matching patterns with variables
• Predictive learning models for concept drift
• Iterative Learning from Texts and Counterexamples Using Additional Information
• Separating sets of strings by finding matching patterns is almost always hard
• Learning concepts and their unions from positive data with refinement operators
• Learning and extending sublanguages
• Morphically primitive words
• Regular patterns, regular languages and context-free languages
• Mind change speed-up for learning languages from positive data
• Learning Efficiency of Very Simple Grammars from Positive Data
• Incremental concept learning for bounded data mining.
• Language learning without overgeneralization
• Necessary and sufficient conditions for learning with correction queries
• Pattern systems
• Language learning without overgeneralization
• Case-based representation and learning of pattern languages
• On a generalized notion of mistake bounds
• Parallelism Increases Iterative Learning Power
• Learning Left-to-Right and Right-to-Left Iterative Languages
• Distinguishing pattern languages with membership examples
• MINIMAL CONCEPT IDENTIFICATION AND RELIABILITY
• Blocksequences of \(k\)-local words
• Inferring regular languages by merging nonterminals
• Learning languages from positive data and a finite number of queries
• Learning erasing pattern languages with queries
• A practical algorithm to find the best subsequence patterns
• Discovering instances of poetic allusion from anthologies of classical Japanese poems
• Co-learning of recursive languages from positive data
• Inductive synthesis of dot expressions
• Inductive synthesis of term rewriting systems
• Learning Block-Preserving Outerplanar Graph Patterns and Its Application to Data Mining
• Remarks on arbitrary multiple pattern interpretations
• 2-testability and relabelings produce everything
• Learning efficiency of very simple grammars from positive data
• Bad News on Decision Problems for Patterns
• Learning unions of tree patterns using queries
• Learning unions of tree patterns using queries
• Detecting patterns in finite regular and context-free languages

Uses Software

• SNOBOL

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)