OpenAlex
On the average number of regularities in a word
Work
Year: 2013
Type: article
Abstract: We study the average number of powers and runs occurring in a word of length n drawn from an alphabet of size σ. We show that a word contains nσ(r−1)−1+o(n) powers of exponent r, at most nσ+o(n) runs,... more
Source: Theoretical Computer Science
Authors Manolis Christodoulakis, Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos
Institutions University of Cyprus, King's College London, Paris-Est Sup, Curtin University
Cites: 35
Cited by: 7
Related to: 10
FWCI: 0.571
Citation percentile (by year/subfield): 65.38
Topic: semigroups and automata theory
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
APC paid (est): $2,690