Local limit laws for symbol statistics in bicomponent rational models

DOI10.1016/J.TCS.2023.114051arXiv2102.09478OpenAlexW3131796287MaRDI QIDQ6168079FDOQ6168079

Authors: Massimiliano Goldwurm, Jianyi Lin, Marco Vignati 

Publication date: 8 August 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Abstract: We study the local limit distribution of the number of occurrences of a symbol in words of length $n$ generated at random in a regular language 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. The limit distributions depend on several parameters and conditions, such as the main constants of mean value and variance of our statistics associated with the two components, and the existence of communications from the first to the second component. The convergence rate of these results is always of order $O(n^{-1/2})$. We also prove an analogous $O(n^{-1/2})$ convergence rate to a Gaussian density of the same statistic whenever the stochastic models only consists of one (primitive) component.

Full work available at URL: https://arxiv.org/abs/2102.09478

zbMATH Keywords

limit distributionsrational seriesregular languagesautomata and formal languageslocal limit lawspattern statistics

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Analytic combinatorics
• Markov Chains
• On convergence rates in the central limit theorems for combinatorial structures
• Title not available (Why is that?)
• Motif statistics.
• Non-negative matrices and Markov chains. 2nd ed
• Central and local limit theorems applied to asymptotic enumeration
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Large deviation properties for patterns
• On pattern frequency occurrences in a Markovian sequence
• Hidden word statistics
• On the number of occurrences of a symbol in words of regular languages.
• Title not available (Why is that?)
• Frequency of symbol occurrences in bicomponent stochastic models
• On computing the coefficients of bivariate holonomic formal series
• Distribution of additive functions with respect to numeration systems on regular languages
• Finite counting automata
• A hitchhiker's guide to descriptional complexity through analytic combinatorics
• On the diversity of pattern distributions in rational language.
• Local limit properties for pattern statistics and rational models
• Developments in Language Theory

This page was built for publication: Local limit laws for symbol statistics in bicomponent rational models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6168079)