Michel Rigo

Eur. J. Comb., 2024

Automatic Abelian Complexities of Parikh-Collinear Fixed Points.

[BibT_eX]

[DOI]

CoRR, 2024

Introducing q-deformed binomial coefficients of words.

[BibT_eX]

[DOI]

Antoine Renard

CoRR, 2024

q-Parikh Matrices and q-deformed binomial coefficients of words.

[BibT_eX]

[DOI]

Antoine Renard

CoRR, 2024

On Extended Boundary Sequences of Morphic and Sturmian Words.

[BibT_eX]

[DOI]

Electron. J. Comb., 2024

2023

Gapped Binomial Complexities in Sequences.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

Automaticity and Parikh-Collinear Morphisms.

[BibT_eX]

[DOI]

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

2022

Ultimate periodicity problem for linear numeration systems.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2022

Automatic sequences: from rational bases to trees.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2022

Revisiting regular sequences in light of rational base numeration systems.

[BibT_eX]

[DOI]

Discret. Math., 2022

On digital sequences associated with Pascal's triangle.

[BibT_eX]

[DOI]

CoRR, 2022

Binomial Complexities and Parikh-Collinear Morphisms.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 26th International Conference, 2022

2021

Reconstructing Words from Right-Bounded-Block Words.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2021

On Cobham's theorem.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Automata Theory., 2021

2020

Computing the <i>k</i>-binomial complexity of the Thue-Morse word.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2020

The binomial equivalence classes of finite words.

[BibT_eX]

[DOI]

Matthieu Rosenfeld

Int. J. Algebra Comput., 2020

Taking-and-merging games as rewrite games.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2020

Templates for the <i>k</i>-binomial complexity of the Tribonacci word.

[BibT_eX]

[DOI]

Matthieu Rosenfeld

Adv. Appl. Math., 2020

The carry propagation of the successor function.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2020

2019

Preface.

[BibT_eX]

[DOI]

Émilie Charlier

Int. J. Found. Comput. Sci., 2019

Automatic sequences based on Parry or Bertrand numeration systems.

[BibT_eX]

[DOI]

Adeline Massuir

Jarkko Peltomäki

Adv. Appl. Math., 2019

Computing the k-binomial Complexity of the Thue-Morse Word.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 23rd International Conference, 2019

Templates for the k-Binomial Complexity of the Tribonacci Word.

[BibT_eX]

[DOI]

Matthieu Rosenfeld

Proceedings of the Combinatorics on Words - 12th International Conference, 2019

2018

Counting Subword Occurrences in Base-b Expansions.

[BibT_eX]

[DOI]

Integers, 2018

2017

Foreword to the special issue dedicated to the sixteenth "Journées Montoises d'Informatique Théorique".

[BibT_eX]

[DOI]

Émilie Charlier

RAIRO Theor. Informatics Appl., 2017

Deciding game invariance.

[BibT_eX]

[DOI]

Aline Parreau

Inf. Comput., 2017

Counting the number of non-zero coefficients in rows of generalized Pascal triangles.

[BibT_eX]

[DOI]

Discret. Math., 2017

Counting Subwords Occurrences in Base-b Expansions.

[BibT_eX]

[DOI]

CoRR, 2017

Behavior of Digital Sequences Through Exotic Numeration Systems.

[BibT_eX]

[DOI]

Electron. J. Comb., 2017

An Efficient Algorithm to Decide Periodicity of b-Recognisable Sets Using MSDF Convention.

[BibT_eX]

[DOI]

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

Nonhomogeneous Beatty Sequences Leading to Invariant Games.

[BibT_eX]

[DOI]

Julien Cassaigne

SIAM J. Discret. Math., 2016

Relations on words.

[BibT_eX]

[DOI]

CoRR, 2016

Generalized Pascal triangle for binomial coefficients of words.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2016

2015

Another generalization of abelian equivalence: Binomial complexity of infinite words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Avoiding 2-binomial squares and cubes.

[BibT_eX]

[DOI]

Michaël Rao

Theor. Comput. Sci., 2015

Asymptotic properties of free monoid morphisms.

[BibT_eX]

[DOI]

CoRR, 2015

A New Approach to the 2-Regularity of the ℓ-Abelian Complexity of 2-Automatic Sequences.

[BibT_eX]

[DOI]

Electron. J. Comb., 2015

2014

A note on abelian returns in rotation words.

[BibT_eX]

[DOI]

Narad Rampersad

Theor. Comput. Sci., 2014

Special issue in the honor of the 14th "Journées Montoises d'Informatique Théorique" - Foreword.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2014

On the number of Abelian Bordered Words (with an Example of Automatic Theorem-Proving).

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2014

2013

Multidimensional extension of the Morse-Hedlund theorem.

[BibT_eX]

[DOI]

Eur. J. Comb., 2013

Towards an analogue of Cobham's theorem for beta-numerations.

[BibT_eX]

[DOI]

CoRR, 2013

Invariant games and non-homogeneous Beatty sequences.

[BibT_eX]

[DOI]

Julien Cassaigne

CoRR, 2013

On the Number of Abelian Bordered Words.

[BibT_eX]

[DOI]

Narad Rampersad

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2012

Syntactic Complexity of Ultimately Periodic Sets of Integers and Application to a Decision Procedure.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2012

2011

Representing real numbers in a generalized numeration system.

[BibT_eX]

[DOI]

Marion Le Gonidec

J. Comput. Syst. Sci., 2011

The Minimal Automaton Recognizing mN in a Linear Numeration System.

[BibT_eX]

[DOI]

Integers, 2011

Logical Characterization of Recognizable Sets of polynomials over a Finite Field.

[BibT_eX]

[DOI]

Laurent Waxweiler

Int. J. Found. Comput. Sci., 2011

Some answer to Nivat's conjecture: A characterization of periodicity with respect to block complexity

[BibT_eX]

[DOI]

CoRR, 2011

Syntactic Complexity of Ultimately Periodic Sets of Integers.

[BibT_eX]

[DOI]

Élise Vandomme

Proceedings of the Language and Automata Theory and Applications, 2011

2010

Systèmes de numération abstraits et combinatoire des mots (habilitation à diriger des recherches).

[BibT_eX]

[DOI]

PhD thesis, 2010

Invariant games.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Extensions and restrictions of Wythoff's game preserving its p positions.

[BibT_eX]

[DOI]

Aviezri S. Fraenkel

Richard J. Nowakowski

J. Comb. Theory A, 2010

Foreword.

[BibT_eX]

[DOI]

Véronique Bruyère

RAIRO Theor. Informatics Appl., 2010

Multidimensional generalized automatic sequences and shape-symmetric morphic words.

[BibT_eX]

[DOI]

Tomi Kärki

Discret. Math., 2010

State Complexity of Testing Divisibility

[BibT_eX]

[DOI]

Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010

Numeration Systems: A Link between Number Theory and Formal Language Theory.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 14th International Conference, 2010

On the Periodicity of Morphic Words.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2009

A Decision Problem for Ultimately Periodic Sets in Nonstandard Numeration Systems.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2009

Representing Real Numbers in a Generalized Numeration Systems

[BibT_eX]

[DOI]

Marion Le Gonidec

CoRR, 2009

A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems

[BibT_eX]

[DOI]

CoRR, 2009

Syndeticity and independent substitutions.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2009

On the Recognizability of Self-generating Sets.

[BibT_eX]

[DOI]

Tomi Kärki

Anne Lacroix

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

2008

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

[BibT_eX]

[DOI]

Valérie Berthé

Theor. Comput. Sci., 2008

A morphic approach to combinatorial games: the Tribonacci case.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2008

Syntactical and automatic properties of sets of polynomials over finite fields.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2008

A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

2007

About frequencies of letters in generalized automatic sequences.

[BibT_eX]

[DOI]

Samuel Nicolay

Theor. Comput. Sci., 2007

Distribution of Additive Functions with Respect to Numeration Systems on Regular Languages.

[BibT_eX]

[DOI]

Peter J. Grabner

Theory Comput. Syst., 2007

Odometers on Regular Languages.

[BibT_eX]

[DOI]

Valérie Berthé

Theory Comput. Syst., 2007

Foreword to the Special Issue Dedicated to the 10th "Journées Montoises d'Informatique Théorique".

[BibT_eX]

[DOI]

Véronique Bruyère

Discret. Math. Theor. Comput. Sci., 2007

Abstract numeration systems on bounded languages and multiplication by a constant

[BibT_eX]

[DOI]

Wolfgang Steiner

CoRR, 2007

2006

A Note on Syndeticity, Recognizable Sets and Cobham's Theorem.

[BibT_eX]

Laurent Waxweiler

Bull. EATCS, 2006

2005

Abstract Numeration Systems and Tilings.

[BibT_eX]

[DOI]

Valérie Berthé

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2004

Characterizing Simpler Recognizable Sets of Integers.

[BibT_eX]

[DOI]

Stud Logica, 2004

Real numbers having ultimately periodic representations in abstract numeration systems.

[BibT_eX]

[DOI]

Inf. Comput., 2004

Decidability questions related to abstract numeration systems.

[BibT_eX]

[DOI]

Juha Honkala

Discret. Math., 2004

2003

The commutative closure of a binary slip-language is context-free: a new proof.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

2002

On the Representation of Real Numbers Using Regular Languages.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2002

More on Generalized Automatic Sequences.

[BibT_eX]

[DOI]

Arnaud Maes

J. Autom. Lang. Comb., 2002

Construction of regular languages and recognizability of polynomials.

[BibT_eX]

[DOI]

Discret. Math., 2002

2001

Numeration systems on a regular language: arithmetic operations, recognizability and formal power series.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Numeration Systems on a Regular Language.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2001

Towards a characterization of the star-free sets of integers

[BibT_eX]

[DOI]

CoRR, 2001

2000

Generalization of automatic sequences for numeration systems on a regular language.

[BibT_eX]

[DOI]