Recurrence Function on Sturmian Words: A Probabilistic Study
From MaRDI portal
Publication:2946329
DOI10.1007/978-3-662-48057-1_9zbMath1465.68220OpenAlexW2156023412MaRDI QIDQ2946329
Brigitte Vallée, Valérie Berthé, Eda Cesaratto, Alfredo Viola, Pablo Rotondo
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
Combinatorics on words (68R15) Permutations, words, matrices (05A05) Combinatorial probability (60C05) Recurrences (11B37)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Handbook of weighted automata
- Continued fraction algorithms, functional operators, and structure constants
- Dynamics of continued fractions with periodic constraints
- Limit values of the recurrence quotient of Sturmian sequences
- Reversals and palindromes in continued fractions
- Dynamical analysis of α-Euclidean algorithms
- Pseudo-randomness of a random Kronecker sequence. An instance of dynamical analysis
This page was built for publication: Recurrence Function on Sturmian Words: A Probabilistic Study