Abstract
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).
| Lingua originale | Inglese |
|---|---|
| Titolo della pubblicazione ospite | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Editore | Springer Verlag |
| Pagine | 306-318 |
| Numero di pagine | 13 |
| Volume | 11647 |
| ISBN (stampa) | 978-3-030-24885-7 |
| DOI | |
| Stato di pubblicazione | Pubblicato - 2019 |
All Science Journal Classification (ASJC) codes
- Informatica Teorica
- Informatica Generale
Keywords
- N/A