Results 31 to 40 of about 81,118 (297)
On the Expressive Power of Regular Expressions with Backreferences
A rewb is a regular expression extended with a feature called backreference. It is broadly known that backreference is a practical extension of regular expressions, and is supported by most modern regular expression engines, such as those in the standard libraries of Java, Python, and more.
Taisei Nogami, Tachio Terauchi
openaire +4 more sources
Learning from Uncurated Regular Expressions
Significant work has been done on learning regular expressions from a set of data values. Depending on the domain, this approach can be very successful.
Mior, Michael J.
core +1 more source
Deterministic automata for extended regular expressions
In this work we present the algorithms to produce deterministic finite automaton (DFA) for extended operators in regular expressions like intersection, subtraction and complement.
Syzdykov Mirzakhmet
doaj +1 more source
stringi: Fast and Portable Character String Processing in R
Effective processing of character strings is required at various stages of data analysis pipelines: from data cleansing and preparation, through information extraction, to report generation. Pattern searching, string collation and sorting, normalization,
Marek Gagolewski
doaj +1 more source
Forkable Regular Expressions [PDF]
We consider forkable regular expressions, which enrich regular expressions with a fork operator, to establish a formal basis for static and dynamic analysis of the communication behavior of concurrent programs. We define a novel compositional semantics for forkable expressions, establish their fundamental properties, and define derivatives for them as ...
Sulzmann, Martin, Thiemann, Peter
openaire +3 more sources
Enhancing Regular Expressions For Polish Text Processing
The paper presents proposition of regular expressions engine based on the modified Thompson’salgorithm dedicated to the Polish language processing.
Krzysztof Dorosz, Anna Szczerbińska
doaj +1 more source
Beyond omega-regular languages: omegaT-regular expressions and their automata and logic counterparts
In the last years, some extensions of ω-regular languages, namely, ωB-regular (ω-regular languages extended with boundedness), ωS-regular (ω-regular languages extended with strong unboundedness), and ωBS-regular languages (the combination of ωB- and ωS ...
David Barozzini +9 more
core +1 more source
Extended Regular Expressions: Succinctness and Decidability [PDF]
Most modern implementations of regular expression engines allow the use of variables (also called back references). The resulting extended regular expressions (which, in the literature, are also called practical regular expressions, rewbr, or regex) are ...
Freydenberger, Dominik +2 more
core +2 more sources
Evaluation of the quality of the Voluntary Geographic Information for the road network in Bogotá D.C
The production of Voluntary Geographic Information has been growing considerably and continues to be an active area of research. However, the lack of knowledge about the quality of information generated on a voluntary and participatory basis raises ...
Luis A. Niño Beltran +3 more
doaj +1 more source
Rewriting of regular expressions and regular path queries [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
DIEGO CALVANESE +3 more
openaire +4 more sources

