On the Uniform Distribution of Strings

In this paper, we propose the definition of a measure for sets of strings of 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. Key words: String, uniform distribution, measure.

• Type: Conference
• Year: 2008
• Where: STRINGOLOGY
• Authors: Sébastien Rebecchi, Jean-Michel Jolion
• Keywords: Complexity Generative Algorithm, Programming Languages, STRINGOLOGY 2008, Uniform Distribution, Uniform Distribution Definition