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
Determine point-to-point networking interactions using regular expressions
As Internet growth and becoming more popular, the number of concurrent data flows start to increasing, which makes sense in bandwidth requested. Providers and corporate customers need ability to identify point-to-point interactions.
Konstantin S. Deev, Yuriy V. Boyko
doaj +1 more source
Research on real-world knowledge mining and knowledge graph completion v(III):structured information extraction from real world data of bladder cancer based on regular expression [PDF]
With the development of medical big data, the real-world study (RWS) has received increasing attention in recent years, and has a good promising prospect.
MA Wenhao+9 more
doaj +1 more source
Processing SPARQL queries with regular expressions in RDF databases [PDF]
Background: As the Resource Description Framework (RDF) data model is widely used for modeling and sharing a lot of online bioinformatics resources such as Uniprot (dev.isb-sib.ch/projects/uniprot-rdf) or Bio2RDF (bio2rdf.org), SPARQL - a W3C ...
Han, WS+6 more
core +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 +5 more sources
A General Framework for the Derivation of Regular Expressions [PDF]
The aim of this paper is to design a theoretical framework that allows us to perform the computation of regular expression derivatives through a space of generic structures.
Caron, Pascal+2 more
core +4 more sources
Arabic Text Processing Model: Verbs Roots and Conjugation Automation
The Natural Language Processing (NLP) is a process to automate the text or speech of Natural Languages. This automation is mainly conducted for Western languages. The Arabic Language got less focus in this area.
Mohamed Tahar Ben Othman+2 more
doaj +1 more source
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
Service Function Chaining Based on Grammar in Software Defined Networks [PDF]
Service Function Chaining is an architecture for orchestrating network services that assign choice to the network. This architecture is essentially a policy structure that should form the proper chain of services.
Pouya Khosravian Dehkordi+3 more
doaj +1 more source
Text Indexing for Regular Expression Matching
Finding substrings of a text T that match a regular expression p is a fundamental problem. Despite being the subject of extensive research, no solution with a time complexity significantly better than O(|T||p|) has been found.
Daniel Gibney, Sharma V. Thankachan
doaj +1 more source