Convergence and Factor Complexity for the Arnoux-Rauzy-Poincaré Algorithm

DOI10.1007/978-3-642-40579-2_10zbMath1400.11018OpenAlexW155640470MaRDI QIDQ2849978

Valérie Berthé, Sébastien Labbé

Publication date: 20 September 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40579-2_10

Mathematics Subject Classification ID

Combinatorics on words (68R15) Number-theoretic algorithms; complexity (11Y16) Continued fractions (11A55)

Related Items (1)

Factor complexity of \(S\)-adic words generated by the Arnoux-Rauzy-Poincaré algorithm

This page was built for publication: Convergence and Factor Complexity for the Arnoux-Rauzy-Poincaré Algorithm