RAIRO-Theor. Inf. Appl.
Volume 40, Number 2, April-June 2006Alberto Bertoni: Climbing summits
|Page(s)||207 - 225|
|Published online||20 July 2006|
Probabilistic models for pattern statistics
Dipartimento di Scienze dell'Informazione,
Università degli Studi di Milano, via Comelico 39/41, 20135 Milano, Italy;
email@example.com & firstname.lastname@example.org.
In this work we study some probabilistic models for the random generation of words over a given alphabet used in the literature in connection with pattern statistics. Our goal is to compare models based on Markovian processes (where the occurrence of a symbol in a given position only depends on a finite number of previous occurrences) and the stochastic models that can generate a word of given length from a regular language under uniform distribution. We present some results that show the differences between these two stochastic models and their relationship with the rational probabilistic measures.
Mathematics Subject Classification: 68Q45 / 68Q10 / 60J99
Key words: Pattern statistics / Markov chains / probabilistic automata / rational formal series.
© EDP Sciences, 2006
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.