Rational series and their languages
Rational series and their languages
On the degree of ambiguity of finite automata
Theoretical Computer Science
The Book of Traces
Automata: Theoretic Aspects of Formal Power Series
Automata: Theoretic Aspects of Formal Power Series
Theoretical Computer Science
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
On the number of occurrences of a symbol in words of regular languages
Theoretical Computer Science
Frequency of symbol occurrences in simple non-primitive stochastic models
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Pattern occurrences in multicomponent models
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Hi-index | 0.00 |
We study the maximum function of any ℝ+-rational formal series S in two commuting variables, which assigns to every integer n∈ℕ, the maximum coefficient of the monomials of degree n. We show that if S is a power of any primitive rational formal series, then its maximum function is of the order Θ(nk / 2λn) for some integer k ≥ –1 and some positive real λ. Our analysis is related to the study of limit distributions in pattern statistics. In particular, we prove a general criterion for establishing Gaussian local limit laws for sequences of discrete positive random variables.