Results 41 to 50 of about 7,225,806 (376)
Regularity preserving modifications of regular expressions
This paper is concerned with the problem of determining whether a set of sequences R\t', obtained by some given rule from a regular set of sequences R, is again a regular set. A number of such problems are solved in this paper and a basic technique is used which is easy to apply to problems of this type.
Richard Edwin Stearns, Juris Hartmanis
openaire +2 more sources
DNA sequence mining is essential in the study of the structure and function of the DNA sequence. A few exploration works have been published in the literature concerning sequence mining in information mining task.
Lakshmanna Kuruva, Khare Neelu
doaj +1 more source
From Regular Expression Matching to Parsing
Given a regular expression $R$ and a string $Q$, the regular expression parsing problem is to determine if $Q$ matches $R$ and if so, determine how it matches, e.g., by a mapping of the characters of $Q$ to the characters in $R$.
Bille, Philip, Gørtz, Inge Li
core +1 more source
Models of Nondeterministic Regular Expressions
AbstractNondeterminism is a direct outcome of interactions and is, therefore a central ingredient for modelling concurrent systems. Trees are very useful for modelling nondeterministic behaviour. We aim at a tree-based interpretation of regular expressions and study the effect of removing the idempotence law X+X=X and the distribution law X•(Y+Z)=X•Y+X•
Flavio Corradini+2 more
openaire +5 more sources
Games for Succinctness of Regular Expressions [PDF]
We present a version of so called formula size games for regular expressions. These games characterize the equivalence of languages up to expressions of a given size. We use the regular expression size game to give a simple proof of a known non-elementary succinctness gap between first-order logic and regular expressions.
openaire +5 more sources
Regular Expression Search on Compressed Text
We present an algorithm for searching regular expression matches in compressed text. The algorithm reports the number of matching lines in the uncompressed text in time linear in the size of its compressed version.
Ganty, Pierre, Valero, Pedro
core +1 more source
Regular Expression Guided Entity Mention Mining from Noisy Web Data
Many important entity types in web documents, such as dates, times, email addresses, and course numbers, follow or closely resemble patterns that can be described by Regular Expressions (REs).
Shanshan Zhang+3 more
semanticscholar +1 more source
This study examines the demographic dynamics of two seabird populations on Tromelin Island, 15 years after the eradication of brown rats. The results indicate that these populations are in good health and are expected to continue growing until breeding sites are saturated in about a century.
Merlène Saunier+6 more
wiley +1 more source
In addressing the challenge of homologous matching for dual sets of recording channels in intelligent substations of 220 kV and above, this paper presents a novel method employing regular expression and Jaccard index.
WANG Guannan+4 more
doaj +1 more source
Human Activity Recognition through Weighted Finite Automata
This work addresses the problem of human activity identification in an ubiquitous environment, where data is collected from a wide variety of sources.
Sergio Salomón, Cristina Tîrnăucă
doaj +1 more source