Rational series and their languages
Rational series and their languages
Probabilistic estimation of the number of prefixes of a trace
Theoretical Computer Science
An introduction to the analysis of algorithms
An introduction to the analysis of algorithms
Automata: Theoretic Aspects of Formal Power Series
Automata: Theoretic Aspects of Formal Power Series
Theoretical Computer Science
On the number of occurrences of a symbol in words of regular languages
Theoretical Computer Science
Frequency of symbol occurrences in bicomponent stochastic models
Theoretical Computer Science - Developments in language theory
| Hi-index | 0.00 |
In this paper, we determine some limit distributions of pattern statistics in rational stochastic models. We present a general approach to analyze these statistics in rational models having an arbitrary number of strongly connected components. We explicitly establish the limit distributions in most significant cases; they are characterized by a family of unimodal density functions defined by means of confluent Vandermonde matrices.