Results 51 to 60 of about 551,541 (325)

Efficient i-DFA construction algorithm based on state grouping

Tongxin xuebao, 2013
Regular expression matching plays an important role in many network and security applications.DFA is the preferred representation to perform regular expression matching in high-speed network,because of its high and stable matching efficiency.However,DFA ...
Deng-ke QIAO, Qing WANG, Ting-wen LIU, Yong SUN, Li GUO   +4 more
doaj   +2 more sources

Regular expression matching technology with two-stage memory

Tongxin xuebao, 2014
To solve the contradiction between the memory requirement and the inspection performance, a matching en-gine with two-stage memory was proposed for the first time. To deploy the state table to two-stage memory, theories of Markov chain was applied to the
Shu-hui CHEN, Cheng-cheng XU
doaj   +2 more sources

Structure-Constrained Process Graphs for the Process Semantics of Regular Expressions [PDF]

arXiv, 2020
Milner (1984) introduced a process semantics for regular expressions as process graphs. Unlike for the language semantics, where every regular (that is, DFA-accepted) language is the interpretation of some regular expression, there are finite process graphs that are not bisimilar to the process interpretation of any regular expression.
arxiv  

Construction of fuzzy automata from fuzzy regular expressions [PDF]

Fuzzy Sets and Systems 199 (2012) 1-27, 2011
Li and Pedrycz [Y. M. Li, W. Pedrycz, Fuzzy finite automata and fuzzy regular expressions with membership values in lattice ordered monoids, Fuzzy Sets and Systems 156 (2005) 68--92] have proved fundamental results that provide different equivalent ways to represent fuzzy languages with membership values in a lattice-ordered monoid, and generalize the ...
arxiv   +1 more source

A cellular system to study responses to a collision between the transcription complex and a protein‐bound nick in the DNA template

FEBS Letters, EarlyView.
We present the cellular transcription‐coupled Flp‐nick system allowing the introduction of a Top1‐mimicking cleavage complex (Flpcc) at a Flp recognition target site within a controllable LacZ gene. LacZ transcription leads to the collision of RNA polymerase II (RNAPII) with Flpcc, and this causes RNAPII stalling, ubiquitination, and degradation.
Petra Herring, Morten Roedgaard, Camilla Myrup Holst, Helene Christensen, Birgitta R. Knudsen, Lotte Bjergbaek, Anni Hangaard Andersen   +6 more
wiley   +1 more source

Rewriting extended regular expressions

Theoretical Computer Science, 1993
We consider an extended algebra of regular events (languages) with intersection besides the usual operations. This algebra has the structure of a distributive lattice with monotonic operations; the latter property is crucial for some applications. We give a new complete Horn equational axiomatization of the algebra and develop some term-rewriting ...
Peter D. Mosses, Valentin M. Antimirov
openaire   +3 more sources

STAT3 expression is reduced in cardiac pericytes in HFpEF and its loss reduces cellular adhesion and induces pericyte senescence

FEBS Letters, EarlyView.
Heart failure with preserved ejection fraction (HFpEF) accounts for half of the heart failure cases. It is characterised by microvascular dysfunction, associated with reduced pericyte coverage and diminished STAT3 expression in pericytes. Loss of STAT3 impairs pericyte adhesion, promotes senescence, and activates a pro‐fibrotic gene program.
Leah Rebecca Vanicek, Ariane Fischer, Mariano Ruz Jurado, Anita Tamiato, Tara Procida‐Kowalski, Jochen Wilhelm, Dennis Hecker, Maximilian Merten, Felicitas Escher, Badder Kattih, Valentina Puntmann, David John, Marcel H. Schulz, Eike Nagel, Stefanie Dimmeler, Guillermo Luxán   +15 more
wiley   +1 more source

The Design of a Verified Derivative-Based Parsing Tool for Regular Expressions

CLEI Electronic Journal, 2021
We describe the formalization of Brzozowski and Antimirov derivative based algorithms for regular expression parsing, in the dependently typed language Agda.
Elton Cardoso, Maycon Amaro, Samuel Feitosa, Leonardo Reis, André Du Bois, Rodrigo Ribeiro   +5 more
doaj   +1 more source

Optimizing Regular Expressions via Rewrite-Guided Synthesis [PDF]

arXiv, 2021
Regular expressions are pervasive in modern systems. Many real-world regular expressions are inefficient, sometimes to the extent that they are vulnerable to complexity-based attacks, and while much research has focused on detecting inefficient regular expressions or accelerating regular expression matching at the hardware level, we investigate ...
arxiv  

Minimizing nfa's and regular expressions

Journal of Computer and System Sciences, 2005
AbstractWe show inapproximability results concerning minimization of nondeterministic finite automata (nfa's) as well as of regular expressions relative to given nfa's, regular expressions or deterministic finite automata (dfa's).We show that it is impossible to efficiently minimize a given nfa or regular expression with n states, transitions ...
Gregor Gramlich, Georg Schnitger
openaire   +3 more sources