245 search results - page 2 / 49 » Using Finite State Automata for Sequence Mining |
IJCAI
1993
13 years 6 months ago
1993
One of the open problems listed in Rivest and Schapire, 1989] is whether and how that the copies of L in their algorithm can be combined into one for better performance. This pape...
AAAI
1992
13 years 6 months ago
1992
It is often useful for a robot to construct a spatial representation of its environment from experiments and observations, in other words, to learn a map of its environment by exp...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
With resemblance of finite-state machines to some biological mechanisms in cells and numerous applications of finite automata in different fields, this paper uses analogies an...
FOSSACS
2008
Springer
13 years 6 months ago
2008
Springer
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
ANCS
2009
ACM
13 years 2 months ago
2009
ACM
Although Regular Expressions (RegExes) have been widely used in network security applications, their inherent complexity often limits the total number of RegExes that can be detec...