We study the local limit distribution of sequences of random variables representing the number of occurrences of a symbol in words of length n in a regular language, generated at random according to a rational stochastic model. We present an analysis of the main local limits when the finite state automaton defining the stochastic model consists of two primitive components. Our results include an evaluation of the convergence rate, which in the various cases is of an order slightly slower than O(n−1/2).
|Title of host publication||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Editors||Piotrek Hofman, Michał Skrzypczak|
|Number of pages||13|
|Publication status||Published - 2019|
|Name||LECTURE NOTES IN COMPUTER SCIENCE|