Closure properties of pattern languages
From MaRDI portal
Publication:340552
DOI10.1016/j.jcss.2016.07.003zbMath1353.68165OpenAlexW1765690313MaRDI QIDQ340552
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
Related Items (2)
Closure and nonclosure properties of the classes of compressible and rankable sets ⋮ Unambiguous injective morphisms in free groups
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Regular and context-free pattern languages over small alphabets
- Patterns with bounded treewidth
- Polynomial-time inference of arbitrary pattern languages
- The equation \(a_ M=b^ Nc^ P\) in a free group
- A non-learnable class of E-pattern languages
- Discontinuities in pattern inference
- Bad news on decision problems for patterns
- Identification of pattern languages from examples and queries
- Finding patterns common to a set of strings
- 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
- Pattern languages with and without erasing
- Inductive inference of unbounded unions of pattern languages from positive data
This page was built for publication: Closure properties of pattern languages
