On the number of occurrences of a symbol in words of regular languages.

DOI10.1016/S0304-3975(02)00892-7zbMath1044.68083OpenAlexW2164211169MaRDI QIDQ1401339

Violetta Lonati, Alberto Bertoni, Massimiliano Goldwurm, Christian Choffrut

Publication date: 17 August 2003

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00892-7

zbMATH Keywords

Discrete Fourier transformGaussian limit distributionAutomata and formal languagesRational formal seriesPerron--Frobenius theory

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (9)

Average Value and Variance of Pattern Statistics in Rational Models ⋮ Local limit laws for symbol statistics in bicomponent rational models ⋮ Generating functions for lattice paths with several forbidden patterns ⋮ Preface ⋮ Frequency of symbol occurrences in bicomponent stochastic models ⋮ Pattern statistics and Vandermonde matrices. ⋮ Locally restricted compositions over a finite group ⋮ Sublogarithmic ambiguity ⋮ Probabilistic models for pattern statistics

Cites Work

• The distribution of subword counts is usually normal
• Random generation of combinatorial structures from a uniform distribution
• String overlaps, pattern matching, and nontransitive games
• Non-negative matrices and Markov chains. 2nd ed
• On pattern frequency occurrences in a Markovian sequence
• Central and local limit theorems applied to asymptotic enumeration
• Random Generation for Finitely Ambiguous Context-free Languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of occurrences of a symbol in words of regular languages.