Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Discovering event queries from traces: Laying foundations for subsequence-queries with wildcards and gap-size constraints
We introduce subsequence-queries with wildcards and gap-size constraints (swg-queries,
for short) as a tool for querying event traces. An swg-query q is given by a string s over an …
for short) as a tool for querying event traces. An swg-query q is given by a string s over an …
Discovering Multi-Dimensional Subsequence Queries from Traces--From Theory to Practice
Subsequence-queries with wildcards and gap-size constraints (swg-queries, for short) are
an expressive model for sequence data, in which queries are described by patterns over an …
an expressive model for sequence data, in which queries are described by patterns over an …
Fast learning of restricted regular expressions and DTDs
DD Freydenberger, T Kötzing - … of the 16th International Conference on …, 2013 - dl.acm.org
We study the problem of generalizing from a finite sample to a language taken from a
predefined language class. The two language classes we consider are subsets of the …
predefined language class. The two language classes we consider are subsets of the …
Puzzling over subsequence-query extensions: Disjunction and generalised gaps
A Frochaux, S Kleest-Meißner - arxiv preprint arxiv:2305.08236, 2023 - arxiv.org
A query model for sequence data was introduced in [11] in the form of subsequence-queries
with wildcards and gap-size constraints (swg-queries, for short). These queries consist of a …
with wildcards and gap-size constraints (swg-queries, for short). These queries consist of a …
Matching patterns with variables
A pattern α α (ie, a string of variables and terminals) matches a word w, if w can be obtained
by uniformly replacing the variables of α α by terminal words. The respective matching …
by uniformly replacing the variables of α α by terminal words. The respective matching …
[HTML][HTML] Revisiting Shinohara's algorithm for computing descriptive patterns
A pattern α is a word consisting of constants and variables and it describes the pattern
language L (α) of all words that can be obtained by uniformly replacing the variables with …
language L (α) of all words that can be obtained by uniformly replacing the variables with …
Inferring descriptive generalisations of formal languages
DD Freydenberger, D Reidenbach - Journal of Computer and System …, 2013 - Elsevier
In the present paper, we introduce a variant of Gold-style learners that is not required to infer
precise descriptions of the languages in a class, but that must find descriptive patterns, ie …
precise descriptions of the languages in a class, but that must find descriptive patterns, ie …
Exploring the Complexity of Event Query Discovery
S Kleest-Meißner - 2024 - edoc.hu-berlin.de
Sequentielle Daten sind meist zeitlich geordnete (un) endliche Datenströme von Events
über einem multi-dimensionalen Eventschema. Systeme über sequentiellen Daten nutzen …
über einem multi-dimensionalen Eventschema. Systeme über sequentiellen Daten nutzen …
[КНИГА][B] Inclusion of pattern languages and related problems
D Freydenberger - 2012 - books.google.com
A pattern is a word that consists of variables and terminal symbols. The pattern language
that is generated by a pattern A is the set of all terminal words that can be obtained from A by …
that is generated by a pattern A is the set of all terminal words that can be obtained from A by …
Efficient Computation of Descriptive Patterns
A pattern↵ is a word consisting of constants and variables and the pattern language L
(↵)(over an alphabet⌃) is the set of all words that can be obtained from↵ by uniformly …
(↵)(over an alphabet⌃) is the set of all words that can be obtained from↵ by uniformly …