Recurrence function on Sturmian words: a probabilistic study

DOI10.1007/978-3-662-48057-1_9MaRDI QIDQ2946329zbMATH OpenOpenAlexFDO

Authors Valérie Berthé, Eda Cesaratto, Pablo Rotondo, Brigitte Vallée, Alfredo Viola

Publication date 16 September 2015

Published in Mathematical Foundations of Computer Science 2015 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-48057-1_9

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Recurrences (11B37) Combinatorial probability (60C05) Combinatorics on words (68R15)

Recommendations

• The recurrence function of a random Sturmian word
• Relation between powers of factors and the recurrence function characterizing Sturmian words
• Random generation of finite Sturmian words
• Return words in Sturmian and episturmian words
• Generalized balances in Sturmian words

Cites work

• Continued fraction algorithms, functional operators, and structure constants
• Dynamical analysis of α-Euclidean algorithms
• Dynamics of continued fractions with periodic constraints
• Handbook of weighted automata
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• scientific article; zbMATH DE number 1926547 (Why is no real title available?)
• Limit values of the recurrence quotient of Sturmian sequences
• Pseudo-randomness of a random Kronecker sequence. An instance of dynamical analysis
• Reversals and palindromes in continued fractions

Cited in

(3)

• Random generation of finite Sturmian words
• The recurrence function of a random Sturmian word
• Recurrence and Frequencies

This page was built for publication: Recurrence function on Sturmian words: a probabilistic study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946329)