WIA
2007
Springer
13 years 10 months ago
2007
Springer
We study the pattern matching automaton introduced in [1] for the purpose of seed-based similarity search. We show that our definition provides a compact automaton, much smaller t...
WIA
2007
Springer
13 years 10 months ago
2007
Springer
The Boyer and Moore (BM) pattern matching algorithm is considered as one of the best, but its performance is reduced on binary data. Yet, searching in binary texts has important a...
WIA
2007
Springer
13 years 10 months ago
2007
Springer
WIA
2007
Springer
13 years 10 months ago
2007
Springer
WIA
2007
Springer
13 years 10 months ago
2007
Springer
We improve an existing bisimulation minimisation algorithm for tree automata by introducing backward and forward bisimulations and developing minimisation algorithms for them. Mini...
WIA
2007
Springer
13 years 10 months ago
2007
Springer
We study the pattern statistics representing the number of occurrences of a given string in a word of length n generated at random by rational stochastic models, defined by means ...
WIA
2007
Springer
13 years 10 months ago
2007
Springer
We introduce a weighted logic with discounting and we establish B¨uchi’s and Elgot’s theorem for weighted automata over finite words and arbitrary commutative semirings. The...
WIA
2007
Springer
13 years 10 months ago
2007
Springer
WIA
2007
Springer
13 years 10 months ago
2007
Springer
WIA
2007
Springer
13 years 10 months ago
2007
Springer
