Rational series and their languages
Rational series and their languages
Theoretical Computer Science - Conference on arithmetics and coding systems, Marseille-Luminy, June 1987
A calculus for the random generation of labelled combinatorial structures
Theoretical Computer Science
Theoretical Computer Science
On the number of occurrences of a symbol in words of regular languages
Theoretical Computer Science
Introduction to probabilistic automata (Computer science and applied mathematics)
Introduction to probabilistic automata (Computer science and applied mathematics)
Hi-index | 0.00 |
We study the pattern statistics representing the number of occurrences of a given string in a word of length n generated at random by rational stochastic models, defined by means of weighted finite automata. We get asymptotic estimations for the mean value and the variance of these statistics under the hypothesis that the matrix of all transition weights is primitive. Our results extend previous evaluations obtained by assuming ergodic stationary Markovian sources and they yield a general framework to determine analogous estimations under several stochastic models. In particular they show the role of the stationarity hypothesis in such models.