Results 261 to 270 of about 413,827 (305)
Approximate regular expression matching with multi-strings
Journal of Discrete Algorithms, 2013 In this paper, we are interested in solving the approximate regular expression matching problem: we are given a regular expression R in advance and we wish to answer the following query: given a text T and a parameter k, find all the substrings of T ...
Mathieu Raffinot
exaly +2 more sources
Fast and compact regular expression matching
Theoretical Computer Science, 2008 We study 4 problems in string matching, namely, regular expression matching, approximate regular expression matching, string edit distance, and subsequence indexing, on a standard word RAM model of computation that allows logarithmic-sized words to be ...
Philip Bille, Martin Farach-Colton
exaly +2 more sources
Bit-coded Regular Expression Parsing
Lecture Notes in Computer Science, 2011 Regular expression parsing is the problem of producing a parse tree of a string for a given regular expression. We show that a compact bit representation of a parse tree can be produced efficiently, in time linear in the product of input string size and ...
Fritz Henglein
exaly +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
On a generalization of regular expression
Programming and Computer Software, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aleksei L. Gomozov +1 more
openaire +2 more sources
Journal of the ACM, 2002
In this article, we definetimed regular expressions, a formalism for specifying discrete behaviors augmented with timing information, and prove that its expressive power is equivalent to thetimed automataof Alur and Dill. This result is the timed analogue of Kleene Theorem and, similarly to that result, the hard part in the proof is the translation ...
Eugene Asarin, Paul Caspi, Oded Maler
openaire +1 more source
In this article, we definetimed regular expressions, a formalism for specifying discrete behaviors augmented with timing information, and prove that its expressive power is equivalent to thetimed automataof Alur and Dill. This result is the timed analogue of Kleene Theorem and, similarly to that result, the hard part in the proof is the translation ...
Eugene Asarin, Paul Caspi, Oded Maler
openaire +1 more source
Regular expressions on the web
2010 12th IEEE International Symposium on Web Systems Evolution (WSE), 2010On the web, static pages fade into the past; web sites use server and client-side scripting techniques to improve the user experience. For client-side scripting, JavaScript is by far the most commonly used dynamic language. In these scripts, regular expressions are widely used for several purposes, e.g., for text filtering and form validation.
Hodován Renáta +2 more
openaire +2 more sources
Efficient Enumeration of Regular Expressions for Faster Regular Expression Synthesis
2021We study the problem of synthesizing regular expressions from a set of positive and negative strings. The previous synthesis algorithm proposed by Lee et al. [12] relies on the best-first enumeration of regular expressions. To improve the performance of the enumeration process, we define a new normal form of regular expressions called the concise ...
Su-Hyeon Kim, Hyeonseung Im, Sang-Ki Ko
openaire +1 more source
THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS
International Journal of Foundations of Computer Science, 2010We 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 +2 more sources