Sébastien Labbé

Proceedings of the Discrete Geometry and Mathematical Morphology, 2024

2023

A Fibonacci analogue of the two's complement numeration system.

[BibT_eX]

[DOI]

Jana Lepsová

RAIRO Theor. Informatics Appl., 2023

2022

A Fibonacci's complement numeration system.

[BibT_eX]

[DOI]

Jana Lepsová

CoRR, 2022

The $q$-analog of the Markoff injectivity conjecture over the language of a balanced sequence.

[BibT_eX]

[DOI]

Mélodie Lapointe

Comb. Theory, 2022

2021

A characterization of Sturmian sequences by indistinguishable asymptotic pairs.

[BibT_eX]

[DOI]

Sebastián Barbieri

Stepán Starosta

Eur. J. Comb., 2021

Substitutive Structure of Jeandel-Rao Aperiodic Tilings.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2021

A Numeration System for Fibonacci-Like Wang Shifts.

[BibT_eX]

[DOI]

Jana Lepsová

Proceedings of the Combinatorics on Words - 13th International Conference, 2021

2017

On the Zero Defect Conjecture.

[BibT_eX]

[DOI]

Edita Pelantová

Stepán Starosta

Eur. J. Comb., 2017

A Permutation on Words in a Two Letter Alphabet.

[BibT_eX]

[DOI]

Niccolò Castronuovo

Robert Cori

Proceedings of the Combinatorics on Words - 11th International Conference, 2017

A Set of Sequences of Complexity 2n+1 2 n + 1.

[BibT_eX]

[DOI]

Julien Cassaigne

Julien Leroy

Proceedings of the Combinatorics on Words - 11th International Conference, 2017

2016

Palindromic sequences generated from marked morphisms.

[BibT_eX]

[DOI]

Edita Pelantová

Eur. J. Comb., 2016

Bispecial Factors in the Brun S-Adic System.

[BibT_eX]

[DOI]

Julien Leroy

Proceedings of the Developments in Language Theory - 20th International Conference, 2016

2015

A d-dimensional Extension of Christoffel Words.

[BibT_eX]

[DOI]

Christophe Reutenauer

Discret. Comput. Geom., 2015

3-dimensional Continued Fraction Algorithms Cheat Sheets.

[BibT_eX]

[DOI]

CoRR, 2015

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

[BibT_eX]

[DOI]

Adv. Appl. Math., 2015

2014

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

[BibT_eX]

[DOI]

CoRR, 2014

A Counterexample to a Question of Hof, Knill and Simon.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

2013

Combinatorial properties of double square tiles.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

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

[BibT_eX]

[DOI]

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

2012

A parallelogram tile fills the plane by translation in at most two distinct ways.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

2011

Palindromic complexity of codings of rotations.

[BibT_eX]

[DOI]

Laurent Vuillon

Theor. Comput. Sci., 2011

Two infinite families of polyominoes that tile the plane by translation in two distinct ways.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Equations on palindromes and circular words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 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

Codings of rotations on two intervals are full.

[BibT_eX]

[DOI]

Laurent Vuillon

Electron. Notes Discret. Math., 2009

Christoffel and Fibonacci Tiles.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 2009

2008

Reconstructing words from a fixed palindromic length sequence.

[BibT_eX]

[DOI]

Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

2007

On the Critical Exponent of Generalized Thue-Morse Words.

[BibT_eX]

[DOI]

Amy Glen