Abstract
Motivated by problems of pattern statistics, we study the limit distribution of the random variable counting the number of occurrences of the symbol a in a word of length n chosen at random in {a,b}*, according to a probability distribution defined via a finite automaton equipped with positive real weights. We determine the local limit distribution of such a quantity under the hypothesis that the transition matrix naturally associated with the finite automaton is primitive. Our probabilistic model extends the Markovian models traditionally used in the literature on pattern statistics.
This result is obtained by introducing a notion of symbol-periodicity for irreducible matrices whose entries are polynomials in one variable over an arbitrary positive semiring. This notion and the related results we prove are of interest in their own right, since they extend classical properties of the Perron–Frobenius Theory for non-negative real matrices.
This work has been supported by the Project M.I.U.R. COFIN 2003-2005 “Formal languages and automata: methods, models and applications”.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bender, E.A.: Central and local limit theorems applied to asymptotic enumeration. Journal of Combinatorial Theory 15, 91–111 (1973)
Berstel, J., Reutenauer, C.: Rational series and their languages. Springer, New York (1988)
Bertoni, A., Choffrut, C., Goldwurm, M., Lonati, V.: On the number of occurrences of a symbol in words of regular languages. Theoretical Computer Science 302(1-3), 431–456 (2003)
de Falco, D., Goldwurm, M., Lonati, V.: Frequency of symbol occurrences in simple nonprimitive stochastic models. In: Esig, Z., Fülop, Z. (eds.) Proceedings 7th D.L.T. Conference. LNCS, vol. 2710, pp. 242–253. Springer, Heidelberg (2003)
Flajolet, P., Sedgewick, R.: The average case analysis of algorithms: multivariate asymptotics and limit distributions. Rapport de recherche n. 3162, INRIA Rocquencourt (May 1997)
Flajolet, P., Sedgewick, R.: Analytic combinatorics: functional equations, rational and algebraic functions. Rapport de recherche n. 4103, INRIA Rocquencourt (January 2001)
Gnedenko, B.V.: The theory of probability. Mir Publishers, Moscow (1976) (translated by Yankovsky, G.)
Guibas, L.J., Odlyzko, A.M.: String overlaps, pattern matching, and nontransitive games. Journal of Combinatorial Theory. Series A 30(2), 183–208 (1981)
Kuich, W., Salomaa, A.: Semirings, automata, languages. Springer, New York (1986)
Nicodème, P., Salvy, B., Flajolet, P.: Motif statistics. Theoretical Computer Science 287(2), 593–617 (2002)
Prum, B., Rudolphe, F., Turckheim, E.: Finding words with unexpected frequencies in deoxyribonucleic acid sequence. J. Roy. Statist. Soc. Ser. B 57, 205–220 (1995)
Régnier, M., Szpankowski, W.: On pattern frequency occurrences in a Markovian sequence. Algorithmica 22(4), 621–649 (1998)
Seneta, E.: Non-negative matrices and Markov chains. Springer, New York (1981)
Waterman, M.: Introduction to computational biology. Chapman & Hall, NewYork (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bertoni, A., Choffrut, C., Goldwurm, M., Lonati, V. (2004). Local Limit Distributions in Pattern Statistics: Beyond the Markovian Models. In: Diekert, V., Habib, M. (eds) STACS 2004. STACS 2004. Lecture Notes in Computer Science, vol 2996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24749-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-24749-4_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21236-2
Online ISBN: 978-3-540-24749-4
eBook Packages: Springer Book Archive