Results 251 to 260 of about 81,118 (297)
Uncovering the role of ABI2 as a key regulator of flowering time in Arabidopsis. [PDF]
Plant Signal BehavAli A, Zareen S, Park J, Yun DJ.
europepmc +1 more source
Splenic B-cell lymphoma/leukemia with prominent nucleoli and spontaneous splenic rupture: a case report and literature review. [PDF]
Front Med (Lausanne)Wang R, Xia Y, Liu H.
europepmc +1 more source
THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS
International Journal of Foundations of Computer Science, 2010 We summarize results on the complexity of regular(-like) expressions and tour a fragment of the literature. In particular we focus on the descriptional complexity of the conversion of regular expressions to equivalent finite automata and vice versa, to the computational complexity of problems on regular-like expressions such as, e.g., membership ...
Markus Holzer 0001, Martin Kutrib
openaire +3 more sources
Regular Expressions with Counting: Weak versus Strong Determinism
SIAM Journal on Computing, 2012 We study deterministic regular expressions extended with the counting operator. There exist two notions of determinism, strong and weak determinism, which almost coincide for standard regular expressions.
Wouter Gelade +2 more
exaly +2 more sources
Regular expressions for data words [PDF]
Journal of Computer and System Sciences, 2015 In this paper we define and study regular expressions for data words. We first define regular expressions with memory (REM), which extend standard regular expressions with limited memory and show that they capture the class of data words defined by ...
Tony Tan, Domagoj Vrgoč
exaly +2 more sources
Derivatives of Regular Expressions
Journal of the ACM, 1964 . Kleene's regular expressions, which can be used for describing sequential circuits, were defined using three operators (union, concatenation and iterate) on sets of sequences.
Janusz A. Brzozowski
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2021
We extend non-deterministic finite automata (NFAs) and regular expressions (regexes) by adding memoization to these formalisms. These extensions are aimed at improving the matching time of backtracking regex matchers. Additionally, we discuss how to extend the concept of ambiguity in order to be applicable to memoized extensions of regexes and NFAs ...
Brink van der Merwe +3 more
openaire +1 more source
We extend non-deterministic finite automata (NFAs) and regular expressions (regexes) by adding memoization to these formalisms. These extensions are aimed at improving the matching time of backtracking regex matchers. Additionally, we discuss how to extend the concept of ambiguity in order to be applicable to memoized extensions of regexes and NFAs ...
Brink van der Merwe +3 more
openaire +1 more source