On the uniform distribution of strings
Résumé
In this paper, we propose the definition of a measure for sets of strings, over a finite alphabet, that have a length not greater than a given number. This measure leads to an instanciation of the uniform distribution definition in sets of such limited-size strings, for which we provide a linear time complexity generative algorithm.
Some ideas could rather easily be extended to other ordered structure types.