Complexité de suites engendrées par des récurrences unipotentes

DOI10.4064/AA-76-1-85-97zbMATH Open0860.68082OpenAlexW625677050MaRDI QIDQ4883043FDOQ4883043

Authors: Pierre Arnoux, Christian Mauduit 

Publication date: 13 April 1997

Published in: Acta Arithmetica (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/206888

Recommendations

• The complexity of generalized Sturmian sequences
• ON INTEGER SEQUENCES GENERATED BY LINEAR MAPS
• Complexity and special factors
• Sequences with subword complexity \(2n\)

zbMATH Keywords

Sturmian sequencesblock complexity

Mathematics Subject Classification ID

Combinatorics on words (68R15) Automata sequences (11B85) Low-dimensional dynamical systems (37E99)

Cited In (7)

• Title not available (Why is that?)
• Episturmian words and episturmian morphisms
• Title not available (Why is that?)
• The complexity of generalized Sturmian sequences
• Decidability of uniform recurrence of morphic sequences
• Complexity of Hartman sequences
• ON INTEGER SEQUENCES GENERATED BY LINEAR MAPS

This page was built for publication: Complexité de suites engendrées par des récurrences unipotentes

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