Results 11 to 20 of about 413,827 (305)
Exploring efficient grouping algorithms in regular expression matching. [PDF]
PLoS ONE, 2018 BACKGROUND:Regular expression matching (REM) is widely employed as the major tool for deep packet inspection (DPI) applications. For automatic processing, the regular expression patterns need to be converted to a deterministic finite automata (DFA ...
Chengcheng Xu, Jinshu Su, Shuhui Chen
doaj +2 more sources
Regular Expression Matching and Operational Semantics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Many programming languages and tools, ranging from grep to the Java String library, contain regular expression matchers. Rather than first translating a regular expression into a deterministic finite automaton, such implementations typically match the ...
Asiri Rathnayake, Hayo Thielecke
doaj +2 more sources
Regular expression order-sorted unification and matching.
J Symb Comput, 2015 We extend order-sorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The obtained signature corresponds to a finite bottom-up unranked tree automaton.
Kutsia T, Marin M.
europepmc +2 more sources
A New Finite Automata Construction Using a Prefix and a Suffix of Regular Expressions [PDF]
, 2021 This paper presents a new method to translate a regular expression into a nondeterministic finite automaton (an NFA for short). Let r be a regular expression and let M be a Thompson automaton for r. We first introduce a labeled Thompson automaton defined
Yamamoto, Hiroaki, Fujiwara, Hiroshi
core +1 more source
Sparse Regular Expression Matching
, 2023 A regular expression specifies a set of strings formed by single characters combined with concatenation, union, and Kleene star operators. Given a regular expression $R$ and a string $Q$, the regular expression matching problem is to decide if $Q ...
Bille, Philip, Gørtz, Inge Li
core +1 more source
Determine point-to-point networking interactions using regular expressions
Trudy Odesskogo Politehničeskogo Universiteta, 2015 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]
Yixue xinzhi zazhiWith 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
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
TECHNOLOGIES OF CREATING SPELL CHECKER
Ìнформаційні технології в освіті, 2019 Spell checkers are created to control and correct mistakes in a user document. They are based on the comparison of every word against the spelling dictionary and on the use of correct spelling detection algorithms.
O. Riezina, R. Kosiuh , V. Vynnychenko
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