Rational series and their languages
Rational series and their languages
Approximate string-matching with q-grams and maximal matches
Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
Probabilistic estimation of the number of prefixes of a trace
Theoretical Computer Science
On pattern occurrences in a random text
Information Processing Letters
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
On the maximum coefficients of rational formal series in commuting variables
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
| Hi-index | 0.00 |
In this paper we determine some limit distributions of pattern statistics in rational stochastic models, defined by means of nondeterministic weighted finite automata. We present a general approach to analyse these statistics in rational models having an arbitrary number of connected components. We explicitly establish the limit distributions in the most significant cases; these ones are characterized by a family of unimodal density functions defined by polynomials over adjacent intervals.