Valérie Berthé

Carl-Fredrik Nyberg-Brodda

Herman Goulet-Ouellet

Dominique Perrin

Karl Petersen

CoRR, 2024

2023

The Monadic Theory of Toric Words.

[BibT_eX]

[DOI]

CoRR, 2023

Recurrence and Frequencies.

[BibT_eX]

[DOI]

Ahmed Mimouni

Proceedings of the Combinatorics on Words - 14th International Conference, 2023

On Substitutions Preserving Their Return Sets.

[BibT_eX]

[DOI]

Herman Goulet-Ouellet

Proceedings of the Combinatorics on Words - 14th International Conference, 2023

2022

On the rigidity of Arnoux-Rauzy words.

[BibT_eX]

[DOI]

Svetlana Puzynina

CoRR, 2022

2021

On the second Lyapunov exponent of some multidimensional continued fraction algorithms.

[BibT_eX]

[DOI]

Wolfgang Steiner

Jörg M. Thuswaldner

Math. Comput., 2021

Analysis of generalized continued fraction algorithms over polynomials.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2021

2020

The carry propagation of the successor function.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2020

On Decision Problems for Substitutions in Symbolic Dynamics.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems - 14th International Conference, 2020

Two Arithmetical Sources and Their Associated Tries.

[BibT_eX]

[DOI]

Proceedings of the 31st International Conference on Probabilistic, 2020

2019

Balancedness and coboundaries in symbolic systems.

[BibT_eX]

[DOI]

Paulina Cecchi Bernales

Theor. Comput. Sci., 2019

2018

The Brun gcd algorithm in high dimensions is almost always subtractive.

[BibT_eX]

[DOI]

Loïck Lhote

Brigitte Vallée

J. Symb. Comput., 2018

Rigidity and Substitutive Dendric Words.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2018

2017

Specular sets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

2016

Probabilistic analyses of the plain multiple gcd algorithm.

[BibT_eX]

[DOI]

Loïck Lhote

Brigitte Vallée

J. Symb. Comput., 2016

Analysis of the Brun Gcd Algorithm.

[BibT_eX]

[DOI]

Loïck Lhote

Brigitte Vallée

Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

Effective S-adic Symbolic Dynamical Systems.

[BibT_eX]

[DOI]

Thomas Fernique

Mathieu Sablik

Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016

2015

Maximal bifix decoding.

[BibT_eX]

[DOI]

Discret. Math., 2015

Factor complexity of <i>S</i>-adic words generated by the Arnoux-Rauzy-Poincaré algorithm.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2015

Recurrence Function on Sturmian Words: A Probabilistic Study.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2014

Connectedness of fractals associated with Arnoux-Rauzy substitutions.

[BibT_eX]

[DOI]

Timo Jolivet

Anne Siegel

RAIRO Theor. Informatics Appl., 2014

Factor Complexity of S-adic sequences generated by the Arnoux-Rauzy-Poincaré Algorithm.

[BibT_eX]

[DOI]

CoRR, 2014

A combinatorial approach to products of Pisot substitutions.

[BibT_eX]

[DOI]

CoRR, 2014

Fine costs for Euclid's algorithm on polynomials and Farey maps.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2014

2013

A study of Jacobi-Perron boundary words for the generation of discrete planes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Balance Properties of Arnoux-Rauzy Words.

[BibT_eX]

[DOI]

Julien Cassaigne

Wolfgang Steiner

Int. J. Algebra Comput., 2013

Bifix codes and the finite index basis property

[BibT_eX]

[DOI]

CoRR, 2013

Return words in interval exchange transformations

[BibT_eX]

[DOI]

CoRR, 2013

Bifix codes in acyclic sets.

[BibT_eX]

[DOI]

CoRR, 2013

Multiple GCDs. probabilistic analysis of the plain algorithm.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

Critical Connectedness of Thin Arithmetical Discrete Planes.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 2013

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

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 9th International Conference, 2013

Generating Discrete Planes with Substitutions.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 9th International Conference, 2013

2012

Selfdual substitutions in dimension one.

[BibT_eX]

[DOI]

Dirk Frettlöh

Víctor F. Sirvent

Eur. J. Comb., 2012

Numeration and discrete dynamical systems.

[BibT_eX]

[DOI]

Computing, 2012

2011

About thin arithmetic discrete planes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Multidimensional Euclidean Algorithms, Numeration and Substitutions.

[BibT_eX]

[DOI]

Integers, 2011

Brun expansions of stepped surfaces.

[BibT_eX]

[DOI]

Thomas Fernique

Discret. Math., 2011

Substitutive Arnoux-Rauzy sequences have pure discrete spectrum

[BibT_eX]

[DOI]

Timo Jolivet

Anne Siegel

CoRR, 2011

Uniformly balanced words with linear complexity and prescribed letter frequencies

[BibT_eX]

[DOI]

Proceedings of the Proceedings 8th International Conference Words 2011, 2011

An Arithmetic and Combinatorial Approach to Three-Dimensional Discrete Lines.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 2011

2009

Diophantine Approximation, Ostrowski Numeration and the Double-Base Number System.

[BibT_eX]

[DOI]

Laurent Imbert

Discret. Math. Theor. Comput. Sci., 2009

Arithmetic Discrete Planes Are Quasicrystals.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 2009

2008

Preface to the special issue dedicated to combinatorics, automata and number theory.

[BibT_eX]

[DOI]

Pierre B. A. Lecomte

Michel Rigo

Theor. Comput. Sci., 2008

Asymptotic behavior of the number of solutions for non-Archimedean Diophantine approximations with restricted denominators.

[BibT_eX]

[DOI]

Hitoshi Nakada

Rie Natsui

Finite Fields Their Appl., 2008

On an involution of Christoffel words and Sturmian morphisms.

[BibT_eX]

[DOI]

Aldo de Luca

Eur. J. Comb., 2008

2007

Discrete rotations and symbolic dynamics.

[BibT_eX]

[DOI]

Bertrand Nouvel

Theor. Comput. Sci., 2007

Functional stepped surfaces, flips, and generalized substitutions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Odometers on Regular Languages.

[BibT_eX]

[DOI]

Michel Rigo

Theory Comput. Syst., 2007

On some applications of generalized functionality for arithmetic discrete planes.

[BibT_eX]

[DOI]

Image Vis. Comput., 2007

On substitution invariant Sturmian words: an application of Rauzy fractals.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2007

2005

Smooth words over arbitrary alphabets.

[BibT_eX]

[DOI]

Srecko Brlek

Philippe Choquette

Theor. Comput. Sci., 2005

Abstract Numeration Systems and Tilings.

[BibT_eX]

[DOI]

Michel Rigo

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Generalized Functionality for Arithmetic Discrete Planes.

[BibT_eX]

[DOI]

Christophe Fiorio

Damien Jamet

Proceedings of the Discrete Geometry for Computer Imagery, 12th International Conference, 2005

2004

Lattices and multi-dimensional words.

[BibT_eX]

[DOI]

Robert Tijdeman

Theor. Comput. Sci., 2004

Two-dimensional iterated morphisms and discrete planes.

[BibT_eX]

[DOI]

Pierre Arnoux

Anne Siegel

Theor. Comput. Sci., 2004

2002

Balance properties of multi-dimensional words.

[BibT_eX]

[DOI]

Robert Tijdeman

Theor. Comput. Sci., 2002

2001

Palindromes and Two-Dimensional Sturmian Sequences.

[BibT_eX]

[DOI]

Laurent Vuillon

J. Autom. Lang. Comb., 2001

Tilings, Quasicrystals, Discrete Planes, Generalized Substitutions, and Multidimensional Continued Fractions.

[BibT_eX]

[DOI]

Proceedings of the Discrete Models: Combinatorics, Computation, and Geometry, 2001

2000

Complexité et automates cellulaires linéaires.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2000

Tilings and rotations on the torus: a two-dimensional generalization of Sturmian sequences.

[BibT_eX]

[DOI]

Laurent Vuillon

Discret. Math., 2000

1996

Fréquences des facteurs des suites sturmiennes.

[BibT_eX]

[DOI]