scientific article; zbMATH DE number 7278096
From MaRDI portal
Publication:5136316
DOI10.4230/LIPIcs.FSTTCS.2017.24zbMath1490.68171MaRDI QIDQ5136316
Pamela Fleischmann, Joel D. Day, Dirk Nowotka, Florin Manea
Publication date: 25 November 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Blocksequences of \(k\)-local words ⋮ Matching patterns with variables under edit distance ⋮ Unnamed Item
Cites Work
- A parameterized study of maximum generalized pattern matching problems
- Inferring descriptive generalisations of formal languages
- Extended regular expressions: succinctness and decidability
- Patterns with bounded treewidth
- Polynomial-time inference of arbitrary pattern languages
- Developments from enquiries into the learnability of the pattern languages from positive data
- Discontinuities in pattern inference
- Finding patterns common to a set of strings
- Pattern matching with variables: a multivariate complexity analysis
- A note on the complexity of matching patterns with variables
- Generalized function matching
- Finite degrees of ambiguity in pattern languages
- The expressibility of languages and relations by word equations
- Distinguishing Pattern Languages with Membership Examples
- A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS
- Inductive inference of unbounded unions of pattern languages from positive data
- Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item