CORR
2008
Springer
13 years 4 months ago
2008
Springer
Abstract. We study the succinctness of the complement and intersection of regular expressions. In particular, we show that when constructing a regular expression defining the compl...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We propose an algorithm that tests membership for regular expressions and show that the algorithm is correct. This algorithm is written in the style of a sequent proof system. The...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated. Algorithms for converting finite automata to...
CLEF
2010
Springer
13 years 5 months ago
2010
Springer
Wikipedia describes itself as the "free encyclopedia that anyone can edit". Along with the helpful volunteers who contribute by improving the articles, a great number of ...
KDID
2003
13 years 6 months ago
2003
This paper provides a framework for the extraction of frequent sequences satisfying a given regular expression (RE) constraint. We take advantage of the information contained in th...
EMNLP
2008
13 years 6 months ago
2008
Regular expressions have served as the dominant workhorse of practical information extraction for several years. However, there has been little work on reducing the manual effort ...
ATVA
2008
Springer
13 years 6 months ago
2008
Springer
Model checking has proven to be a useful analysis technique not only for concurrent systems, but also for the genetic regulatory networks (Grns) that govern the functioning of livi...
EDBT
2009
ACM
13 years 8 months ago
2009
ACM
The classic Generalized Sequential Patterns (GSP) algorithm returns all frequent sequences present in a database. However, usually a few ones are interesting from a user's po...
FOSSACS
2007
Springer
13 years 8 months ago
2007
Springer
By adding the complement operator (
CONEXT
2007
ACM
13 years 8 months ago
2007
ACM
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...