Closure properties of pattern languages

No abstract is available for this paper.

• Publication year

  2014

• Venue

  Journal of computer and system sciences (Print)

• Publication date

  2014-08-26

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.jcss.2016.07.003
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• On the Parameterised Complexity of String Morphism Problems

  2015cited by this paper
• Pattern matching with variables: A multivariate complexity analysis

  2013cited by this paper
• Patterns with bounded treewidth

  2012cited by this paper
• Regular and context-free pattern languages over small alphabets

  2012cited by this paper
• Regular patterns, regular languages and context-free languages

  2010cited by this paper
• Discontinuities in pattern inference ⋆

  2008influential reference
• Bad News on Decision Problems for Patterns

  2008cited by this paper
• An Examination of Ohlebusch and Ukkonen's Conjecture on the Equivalence Problem for E-Pattern Languages

  2007cited by this paper
• A non-learnable class of E-pattern languages

  2006cited by this paper
• Combinatorics on Words

  2004influential reference
• Inductive inference of unbounded unions of pattern languages from positive data

  1996cited by this paper
• Decision Problems for Patterns

  1995influential reference
• Pattern languages with and without erasing

  1994influential reference
• Polynomial-time inference of arbitrary pattern languages

  1991cited by this paper
• Identification of unions of languages drawn from an identifiable class

  1989cited by this paper
• Identification of Pattern Languages from Examples and Queries

  1987cited by this paper
• INFERRING UNIONS OF TWO PATTERN LANGUAGES

  1983influential reference
• On the Equality Sets for Homomorphisms on Free Monoids with Two Generators

  1980cited by this paper
• Finding Patterns Common to a Set of Strings

  1980cited by this paper
• The equation $a^M=b^Nc^P$ in a free group.

  1962cited by this paper

• Unambiguous injective morphisms in free groups

  2022cites this paper
• Closure and nonclosure properties of the classes of compressible and rankable sets

  2021cites this paper
• Distinguishing Linear Sets and Pattern Languages With Membership Examples

  2017cites this paper