Let us assume that we have a number of independent sources where each source generates random strings of fixed length M, composed of symbols drawn from an alphabet R. Each source generates these random strings according to its own distribution. The problem we consider in this correspondence is one of identifying the source given a sequence of random strings. Two modes of random string generation are analyzed. In the first mode, arbitrary strings are generated in which the individual symbols can occur many times in the strings. In the second mode the individual symbols occur exactly once in each random string. The latter case corresponds to the situation in which the sources generate random permutations. In both these cases, the best match t...
In a random number generation task, participants are asked to generate a random sequence of numbers,...
International audienceIn a tabular database, patterns which occur over a frequency threshold are cal...
We explain how to apply statistical techniques to solve several language-recognition problems that a...
Abstract. In pattern matching algorithms, two characteristic parameters play an important rôle: the ...
In this work we study some probabilistic models for the random generation of words over a given alph...
International audienceThe analysis of pattern occurrences has numerous applications, in particular i...
Chaitin s algorithmic definition of random strings - based on the complexity induced by self-delimit...
The Common Substring in Random Strings (CSRS) problem is defined as follows: what is the probability...
We introduce a new concept of randomness for binary strings of finite length, reconstructive randomn...
We address the problem of estimating the probability of an observed string that is drawn i.i.d. from...
We deal with the problem of extracting as much randomness as possible from a defective random source...
A novel random text generation model is introduced. Unlike in previous random text models, that main...
Consider a given pattern H and a random text T generated by a Markovian source of any order. We stud...
Many results in statistics and information theory are asymptotic in nature, with the implicit assump...
atteson. ~ p eaplant, biology, yale. edu We present algorithms for the exact computation of the prob...
In a random number generation task, participants are asked to generate a random sequence of numbers,...
International audienceIn a tabular database, patterns which occur over a frequency threshold are cal...
We explain how to apply statistical techniques to solve several language-recognition problems that a...
Abstract. In pattern matching algorithms, two characteristic parameters play an important rôle: the ...
In this work we study some probabilistic models for the random generation of words over a given alph...
International audienceThe analysis of pattern occurrences has numerous applications, in particular i...
Chaitin s algorithmic definition of random strings - based on the complexity induced by self-delimit...
The Common Substring in Random Strings (CSRS) problem is defined as follows: what is the probability...
We introduce a new concept of randomness for binary strings of finite length, reconstructive randomn...
We address the problem of estimating the probability of an observed string that is drawn i.i.d. from...
We deal with the problem of extracting as much randomness as possible from a defective random source...
A novel random text generation model is introduced. Unlike in previous random text models, that main...
Consider a given pattern H and a random text T generated by a Markovian source of any order. We stud...
Many results in statistics and information theory are asymptotic in nature, with the implicit assump...
atteson. ~ p eaplant, biology, yale. edu We present algorithms for the exact computation of the prob...
In a random number generation task, participants are asked to generate a random sequence of numbers,...
International audienceIn a tabular database, patterns which occur over a frequency threshold are cal...
We explain how to apply statistical techniques to solve several language-recognition problems that a...