On Dec 8, 12:06 am, Andrew Tomazos> Summary: We want to find out how often a given token appears in a> random stream formed by concatenating randomly chosen strings from a> given set of strings.>> Details:>> Given S, an array of n (non-empty) strings; and T, a string of length> m;>> We create a random stream of characters by the following process:>> 1. assign i = a (uniformly) random integer between 1 and n> inclusive> 2. write the characters of the ith element of S to the stream> 3. goto 1>> (The elements of S are not necessarily the same length)>> For example:>> if S = {"a", "bug", "ug"}>> then the stream may start as follows:>> augbugugugaabug...>> Each time T appears in the stream we call that a hit. More precisely:>> 1. Initialize a queue Q with m null elements>> 2. If Q equals T record a hit> 3. Pop front of Q> 4. Push to back of Q next char from stream> 5. Goto 2>> For example:>> If T = "ugu"...>> then:>> augbugugugaabug...> 1 2>> We get two hits so far.>> (Note hits can overlap each other)>> What is the expected frequency of hits in terms of S and T?

Some half-baked ideas. No warranty expressed or implied:

I think you'll need to analyze S exhaustively to enumerate all S index
sequences that can produce hits. This seems something like genome
matching: string search to find covers. Prefix matching algorithms,
tries and suffix trees might be helpful if T and S members can be
long. Use the index sequences to build a Mealy machine (DFA) that
consumes a stream of indices and produces respective numbers of hits.
You should be able to analyze this machine as a Markov chain to get
how much time is spent in each state, consequently how many hits are
being generated per index of input. You'll have to adjust this to get
hits per character rather than hits per index, but that should be
straightforward. At worst you'd have to split states outputing non-
zero so that all incoming transitions are on indexes of strings having
the same length. But there might be an easier way.