Results 21 to 30 of about 413,827 (305)
From regular expression matching to parsing
, 2022 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, i.e., by a mapping of the characters of Q to the characters in R.
Bille, Philip, Gørtz, Inge Li
core +1 more source
Service Function Chaining Based on Grammar in Software Defined Networks [PDF]
مجله مدل سازی در مهندسی, 2019 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
On Extended Regular Expressions [PDF]
, 2009 In this paper we extend the work of Campeanu, Salomaa and Yu [1] on extended regular expressions featured in the Unix utility egrep and the popular scripting language Perl. We settle the open issue of closure under intersection and provide an improved pumping lemma that will show that a larger class of languages is not recognizable by extended regular ...
Benjamin Carle, Paliath Narendran
openaire +1 more source
Text Indexing for Regular Expression Matching
Algorithms, 2021 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
On the Expressive Power of Regular Expressions with Backreferences
CoRR, 2023 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
From Regular Expression Matching to Parsing [PDF]
, 2019 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
Cybersecurity Named Entity Recognition Using Multi-Modal Ensemble Learning
IEEE Access, 2020 Cybersecurity named entity recognition is an important part of threat information extraction from large-scale unstructured text collection in many cybersecurity applications.
Feng Yi, Bo Jiang, Lu Wang, Jianjun Wu
doaj +1 more source
Forkable Regular Expressions [PDF]
, 2016 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
Journal of Intelligent Systems, 2018 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
Rewriting of regular expressions and regular path queries [PDF]
Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
DIEGO CALVANESE +3 more
openaire +4 more sources