Abstract
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.
This work has been supported by the Project MIUR PRIN 2005-2007 “Automata and Formal Languages: mathematical and applicative aspects”.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Régnier, M., Szpankowski, W.: On pattern frequency occurrences in a Markovian sequence. Algorithmica 22, 631–649 (1998)
Jacket, P., Szpankowski, W.: Analytic approach to pattern matching. In: Lothaire, M. (ed.) Applied Combinatorics on Words. Encyclopedia of Mathematics and its Applications, vol. 105, Cambridge University Press, Cambridge (2005)
Nicodème, P., Salvy, B., Flajolet, P.: Motif statistics. Theoret. Comput. Sci. 287, 593–617 (2002) Algorithms (Prague, 1999)
Bertoni, A., Choffrut, C., Goldwurm, M., Lonati, V.: On the number of occurrences of a symbol in words of regular languages. Theoret. Comput. Sci. 302, 431–456 (2003)
Goldwurm, M., Radicioni, R.: Probabilistic models for pattern statistics. Theor. Inform. Appl. 40, 207–225 (2006)
Seneta, E.: Non-negative matrices and Markov chains. Springer Series in Statistics. Springer, New York (2006)
Gantmacher, F.R.: The theory of matrices. Translated by K.A. Hirsch, vol. 2. Chelsea Publishing Co., New York (1959)
Iosifescu, M.: Finite Markov processes and their applications. Wiley Series in Probability and Mathematical Statistics. John Wiley & Sons Ltd., Chichester (1980)
Berstel, J., Reutenauer, C.: Rational series and their languages. EATCS Monographs on Theoretical Computer Science, vol. 12. Springer, Berlin (1988)
Hansel, G., Perrin, D.: Rational probability measures. Theoret. Comput. Sci. 65, 171–188 (1989)
Paz, A.: Introduction to probabilistic automata. Academic Press, New York (1971)
Flajolet, P., Zimmerman, P., van Cutsem, B.: A calculus for the random generation of labelled combinatorial structures. Theoret. Comput. Sci. 132, 1–35 (1994)
Denise, A.: Génération aléatoire uniforme de mots de langages rationnels. Theoret. Comput. Sci. 159, 43–63 (1996) Selected papers from the “GASCOM ’94” (Talence, 1994) and the “Polyominoes and Tilings” (Toulouse, 1994) Workshops.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goldwurm, M., Radicioni, R. (2007). Average Value and Variance of Pattern Statistics in Rational Models. In: Holub, J., Žďárek, J. (eds) Implementation and Application of Automata. CIAA 2007. Lecture Notes in Computer Science, vol 4783. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76336-9_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-76336-9_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76335-2
Online ISBN: 978-3-540-76336-9
eBook Packages: Computer ScienceComputer Science (R0)