Abstract
We present a non-Gaussian local limit theorem for the number of occurrences of a given symbol in a word of length n generated at random. The stochastic model for the random generation is defined by a rational formal series with non-negative real coefficients. The result yields a local limit towards a uniform density function and holds under the assumption that the formal series defining the model is recognized by a weighted finite state automaton with two primitive components having equal dominant eigenvalue.
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
Similar content being viewed by others
Notes
- 1.
Here, for every interval \(I\subseteq \mathbb {R}\) and functions \(f,g :I \rightarrow \mathbb {C}\), by “\(g(t)=O(f(t))\) for \(t\in I\)” we mean “\(|g(t)| \le b |f(t)|\) for all \(t\in I\)”, for some constant \(b>0\).
References
Bender, E.A.: Central and local limit theorems applied to asymptotic enumeration. J. Comb. 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. Theoret. Comput. Sci. 302, 431–456 (2003)
Bertoni, A., Choffrut, C., Goldwurm, M., Lonati, V.: Local limit properties for pattern statistics and rational models. Theory Comput. Syst. 39, 209–235 (2006)
Broda, S., Machiavelo, A., Moreira, N., Reis, R.: A hitchhiker’s guide to descriptional complexity through analytic combinatorics. Theory Comput. Syst. 528, 85–100 (2014)
Broda, S., Machiavelo, A., Moreira, N., Reis, R.: On the average complexity of strong star normal form. In: Pighizzini, G., Câmpeanu, C. (eds.) DCFS 2017. LNCS, vol. 10316, pp. 77–88. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-60252-3_6
de Falco, D., Goldwurm, M., Lonati, V.: Frequency of symbol occurrences in bicomponent stochastic models. Theoret. Comput. Sci. 327(3), 269–300 (2004)
Denise, A.: Génération aléatoire uniforme de mots de langages rationnels. Theoret. Comput. Sci. 159, 43–63 (1996)
Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, Cambridge (2009)
Gnedenko, B.V.: Theory of Probability. Gordon and Breach Science Publisher, Amsterdam (1997)
Nicodeme, P., Salvy, B., Flajolet, P.: Motif statistics. Theoret. Comput. Sci. 287(2), 593–617 (2002)
Prum, B., Rudolphe, F., Turckheim, E.: Finding words with unexpected frequencies in deoxyribonucleic acid sequence. J. Roy. Stat. 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)
Salomaa, A., Soittola, M.: Automata-Theoretic Aspects of Formal Power Series. Springer, New York (1978). https://doi.org/10.1007/978-1-4612-6264-0
Seneta, E.: Non-negative Matrices and Markov Chains. Springer, New York (1981). https://doi.org/10.1007/0-387-32792-4
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 IFIP International Federation for Information Processing
About this paper
Cite this paper
Goldwurm, M., Lin, J., Vignati, M. (2018). A Local Limit Property for Pattern Statistics in Bicomponent Stochastic Models. In: Konstantinidis, S., Pighizzini, G. (eds) Descriptional Complexity of Formal Systems. DCFS 2018. Lecture Notes in Computer Science(), vol 10952. Springer, Cham. https://doi.org/10.1007/978-3-319-94631-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-94631-3_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-94630-6
Online ISBN: 978-3-319-94631-3
eBook Packages: Computer ScienceComputer Science (R0)
