Closure properties of pattern languages

DOI10.1016/J.JCSS.2016.07.003zbMATH Open1353.68165OpenAlexW1765690313MaRDI QIDQ340552FDOQ340552

Daniel Reidenbach, Markus L. Schmid, Joel D. Day

Publication date: 14 November 2016

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://dspace.lboro.ac.uk/2134/22205

Recommendations

• Closure properties of pattern languages
• On the closure of pattern expressions languages under intersection with regular languages
• scientific article; zbMATH DE number 2150289
• scientific article; zbMATH DE number 992009
• scientific article; zbMATH DE number 522839

zbMATH Keywords

pattern languagesclosure properties

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Finding patterns common to a set of strings
• The equation \(a_ M=b^ Nc^ P\) in a free group
• Title not available (Why is that?)
• Title not available (Why is that?)
• Patterns with bounded treewidth
• Pattern languages with and without erasing
• A non-learnable class of E-pattern languages
• Discontinuities in pattern inference
• Title not available (Why is that?)
• Bad news on decision problems for patterns
• Identification of pattern languages from examples and queries
• Regular patterns, regular languages and context-free languages
• Decision problems for patterns
• Pattern matching with variables: a multivariate complexity analysis
• Closure Properties of Pattern Languages
• An examination of Ohlebusch and Ukkonen's conjecture on the equivalence problem for E-pattern languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• Regular and context-free pattern languages over small alphabets
• Inductive inference of unbounded unions of pattern languages from positive data
• Polynomial-time inference of arbitrary pattern languages

Cited In (6)

• Unambiguous injective morphisms in free groups
• Properties of Java Simple Closures
• On the closure of pattern expressions languages under intersection with regular languages
• Closure and nonclosure properties of the classes of compressible and rankable sets
• A closure property of regular languages
• Two non-closure results on families ofL languages

This page was built for publication: Closure properties of pattern languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q340552)