Rational series and their languages
Rational series and their languages
Uniform random generation of words of rational languages
Theoretical Computer Science - Special issue: selected papers from “GASCOM '94” and the “Polyominoes and Tilings” workshops
The Mathematica book (4th edition)
The Mathematica book (4th edition)
Theoretical Computer Science
Experience Management: Lessons Learned from Knowledge Engineering
Proceedings of the 1st German Workshop on on Experience Management: Sharing Experiences about the Sharing of Experience
On the number of occurrences of a symbol in words of regular languages
Theoretical Computer Science
Pattern statistics and Vandermonde matrices
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Pattern occurrences in multicomponent models
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Hi-index | 0.00 |
We give asymptotic estimates of the frequency of occurrences of a symbol in a random word generated by any bicomponent stochastic model. More precisely, we consider the random variable Yn, representing the number of occurrences of a given symbol in a word of length n generated at random; the stochastic model is defined by a rational formal series r having a linear representation with two primitive components. This model includes the case when r is the product or the sum of two primitive rational formal series. We obtain asymptotic evaluations for the mean value and the variance of Yn and its limit distribution.