245 search results - page 23 / 49 » Using Finite State Automata for Sequence Mining |
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. This paper shows that we can take advantage of information about the probabilities of the occurrences of events, when this information is available, to refine the classic...
TON
2012
11 years 10 months ago
2012
—Regular expressions (RegExes) are widely used, yet their inherent complexity often limits the total number of RegExes that can be detected using a single chip for a reasonable t...
ISCIS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Based on a distinguishing sequence for a Finite State Machine (FSM), an efficient checking sequence may be produced from the elements of a set Eα of α –sequences and ...
ENTCS
2008
13 years 8 months ago
2008
Non-deterministic (also known as possibilistic) and probabilistic state based systems (or automata) have been studied for quite some time. Separately, they are reasonably well-und...
VTS
1998
IEEE
14 years 4 days ago
1998
IEEE
This paper presents a BIST architecture for Finite State Machines that exploits Cellular Automata (CA) as pattern generators and signature analyzers. The main advantage of the pro...