Sciweavers

2409 search results - page 18 / 482
» On Extended Regular Expressions
Sort
View
ICDM
2008
IEEE
129views Data Mining» more  ICDM 2008»
15 years 4 months ago
Sequence Mining Automata: A New Technique for Mining Frequent Sequences under Regular Expressions
In this paper we study the problem of mining frequent sequences satisfying a given regular expression. Previous approaches to solve this problem were focusing on its search space,...
Roberto Trasarti, Francesco Bonchi, Bart Goethals
LATA
2010
Springer
15 years 2 months ago
Simplifying Regular Expressions. A Quantitative Perspective
Abstract. We consider the efficient simplification of regular expressions and suggest a quantitative comparison of heuristics for simplifying regular expressions. To this end, we...
Hermann Gruber and Stefan Gulan
LATA
2010
Springer
15 years 7 months ago
The Inclusion Problem for Regular Expressions
This paper presents a new polynomial-time algorithm for the inclusion problem for certain pairs of regular expressions. The algorithm is not based on construction of finite automat...
Dag Hovland
CPM
1998
Springer
132views Combinatorics» more  CPM 1998»
15 years 1 months ago
Reporting Exact and Approximate Regular Expression Matches
While much work has been done on determining if a document or a line of a document contains an exact or approximate match to a regular expression, less e ort has been expended in ...
Eugene W. Myers, Paulo Oliva, Katia S. Guimar&atil...
ARC
2011
Springer
270views Hardware» more  ARC 2011»
14 years 4 months ago
A Regular Expression Matching Circuit Based on a Decomposed Automaton
In this paper, we propose a regular expression matching circuit based on a decomposed automaton. To implement a regular expression matching circuit, first, we convert regular expr...
Hiroki Nakahara, Tsutomu Sasao, Munehiro Matsuura