In a recent work we have determined the local limit distribution of pattern statistics representing the number of occurrences of a symbol in words of length n in a regular language generated at random according to a suitable stochastic model. Such a model is defined by a finite automaton with weights in ℝ+, consisting of two primitive components, having some transition from the first to the second component. In the present work we extend those results to the case when there is no communication among the components, and hence the associated formal series is the sum of two rational series recognized by finite state automata with primitive transition matrix. We obtain local limit laws of Gaussian type when there is a dominant component or when, in equipotent case, the main terms of mean value and variance are equal. On the contrary, if these terms are not the same then the local limit distribution is a convex combination of Gaussian laws. All convergence rates of our limits are of the order O(n−1/2). This completes the analysis of local limit laws of symbol statistics under a bicomponent stochastic model1.

Goldwurm, M., Lin, J., Vignati, M., Saddle point method in the analysis of pattern statistics for regular languages, in CEUR Workshop Proceedings, (ita, 09-11 September 2019), CEUR-WS, Aachen 2019:<<CEUR WORKSHOP PROCEEDINGS>>,2504 78-90 [http://hdl.handle.net/10807/178236]

Saddle point method in the analysis of pattern statistics for regular languages

Abstract

In a recent work we have determined the local limit distribution of pattern statistics representing the number of occurrences of a symbol in words of length n in a regular language generated at random according to a suitable stochastic model. Such a model is defined by a finite automaton with weights in ℝ+, consisting of two primitive components, having some transition from the first to the second component. In the present work we extend those results to the case when there is no communication among the components, and hence the associated formal series is the sum of two rational series recognized by finite state automata with primitive transition matrix. We obtain local limit laws of Gaussian type when there is a dominant component or when, in equipotent case, the main terms of mean value and variance are equal. On the contrary, if these terms are not the same then the local limit distribution is a convex combination of Gaussian laws. All convergence rates of our limits are of the order O(n−1/2). This completes the analysis of local limit laws of symbol statistics under a bicomponent stochastic model1.
Scheda breve Scheda completa Scheda completa (DC)
2019
Inglese
CEUR Workshop Proceedings
20th Italian Conference on Theoretical Computer Science, ICTCS 2019
ita
9-set-2019
11-set-2019
N/A
CEUR-WS
Goldwurm, M., Lin, J., Vignati, M., Saddle point method in the analysis of pattern statistics for regular languages, in CEUR Workshop Proceedings, (ita, 09-11 September 2019), CEUR-WS, Aachen 2019:<<CEUR WORKSHOP PROCEEDINGS>>,2504 78-90 [http://hdl.handle.net/10807/178236]
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: `https://hdl.handle.net/10807/178236`
• ND
• 0
• ND