Results 21 to 30 of about 81,118 (297)
A generalization of regular expressions
Informatica, 1999 Summary: CF-expressions are defined which generalize the regular one. It is established that so-called pseudo-coiterating CF-expressions characterize the regular sets. The results are used to develop some more characterizations of the regular sets: the pseudo-coiterating D-graphs and the pseudo-coiterating pushdown automata (PDAs).
Gomozov, Aleksei L. +1 more
openaire +2 more sources
IEEE Access, 2020 The Multifamily classification of Android malware aims to identify a malicious sample as one of the given malware families. This problem is believed to be much more significant than the binary classification (simply identify a sample as malicious or ...
Xiaojian Liu +3 more
doaj +1 more source
Categorizing Event Sequences Using Regular Expressions
IASSIST Quarterly, 1998 Categorizing Event Sequences Using Regular ...
Lisa Sanfilippo
doaj +1 more source
Determinization and Minimization of Automata for Nested Words Revisited
Algorithms, 2021 We consider the problem of determinizing and minimizing automata for nested words in practice. For this we compile the nested regular expressions (NREs) from the usual XPath benchmark to nested word automata (NWAs).
Joachim Niehren, Momar Sakho
doaj +1 more source
Categorizing Event Sequences Using Regular Expressions
IASSIST Quarterly, 1997 Categorizing Event Sequences Using Regular ...
Lisa Sanfilippo
doaj +1 more source
Ethereum Smart Contract Bug Detection and Repair Approach Based on Regular Expressions, Program Instrumentation and Code Replacement [PDF]
Jisuanji kexue, 2021 As the largest blockchain platform supporting smart contracts,millions of smart contracts have been deployed on Ethereum.Since the deployed smart contracts cannot be modified even if the contracts contain bugs,it is critical for developers to eliminate ...
XIAO Feng, ZHANG Peng-cheng, LUO Xia-pu
doaj +1 more source
Regularity preserving modifications of regular expressions
Information and Control, 1963 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 +1 more source
Extending Graph Pattern Matching with Regular Expressions
, 2020 Graph pattern matching, which is to compute the set M(Q, G) of matches of Q in G, for the given pattern graph Q and data graph G, has been increasingly used in emerging applications e.g., social network analysis.
Xin Wang +9 more
core +1 more source
USE OF REGULAR EXPRESSIONS AS TEMPLATES IN FORMATIVE AND SUMMATIVE OPEN ANSWER QUESTIONS
Открытое образование (Москва), 2016 The article describes problems in automated students testing using open-form questions with substantial amount of correct answers. Authors propose using of regular expressions as correct answer patterns.
Oleg A. Sychev, Valeriy O. Streltsov
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