Michel Rigo

According to our database1, Michel Rigo authored at least 70 papers between 2000 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
On the binomial equivalence classes of finite words.
CoRR, 2020

Templates for the k-binomial complexity of the Tribonacci word.
Adv. Appl. Math., 2020

Reconstructing Words from Right-Bounded-Block Words.
Proceedings of the Developments in Language Theory - 24th International Conference, 2020

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

The carry propagation of the successor function.
CoRR, 2019

Taking-and-merging games as rewrite games.
CoRR, 2019

Automatic sequences based on Parry or Bertrand numeration systems.
Adv. Appl. Math., 2019

Computing the k-binomial Complexity of the Thue-Morse Word.
Proceedings of the Developments in Language Theory - 23rd International Conference, 2019

Templates for the k-Binomial Complexity of the Tribonacci Word.
Proceedings of the Combinatorics on Words - 12th International Conference, 2019

2018
Counting Subword Occurrences in Base-b Expansions.
Integers, 2018

2017
Foreword to the special issue dedicated to the sixteenth "Journées Montoises d'Informatique Théorique".
RAIRO Theor. Informatics Appl., 2017

Deciding game invariance.
Inf. Comput., 2017

Counting the number of non-zero coefficients in rows of generalized Pascal triangles.
Discret. Math., 2017

Counting Subwords Occurrences in Base-b Expansions.
CoRR, 2017

Behavior of Digital Sequences Through Exotic Numeration Systems.
Electron. J. Comb., 2017

An Efficient Algorithm to Decide Periodicity of b-Recognisable Sets Using MSDF Convention.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Nonhomogeneous Beatty Sequences Leading to Invariant Games.
SIAM J. Discret. Math., 2016

Relations on words.
CoRR, 2016

Generalized Pascal triangle for binomial coefficients of words.
Adv. Appl. Math., 2016

2015
Another generalization of abelian equivalence: Binomial complexity of infinite words.
Theor. Comput. Sci., 2015

Avoiding 2-binomial squares and cubes.
Theor. Comput. Sci., 2015

Asymptotic properties of free monoid morphisms.
CoRR, 2015

A New Approach to the 2-Regularity of the ℓ-Abelian Complexity of 2-Automatic Sequences.
Electron. J. Comb., 2015

2014
A note on abelian returns in rotation words.
Theor. Comput. Sci., 2014

Special issue in the honor of the 14th "Journées Montoises d'Informatique Théorique" - Foreword.
RAIRO Theor. Informatics Appl., 2014

On the number of Abelian Bordered Words (with an Example of Automatic Theorem-Proving).
Int. J. Found. Comput. Sci., 2014

2013
Multidimensional extension of the Morse-Hedlund theorem.
Eur. J. Comb., 2013

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

Invariant games and non-homogeneous Beatty sequences.
CoRR, 2013

On the Number of Abelian Bordered Words.
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.
Fundam. Inform., 2012

2011
Representing real numbers in a generalized numeration system.
J. Comput. Syst. Sci., 2011

The Minimal Automaton Recognizing mN in a Linear Numeration System.
Integers, 2011

Logical Characterization of Recognizable Sets of polynomials over a Finite Field.
Int. J. Found. Comput. Sci., 2011

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

Syntactic Complexity of Ultimately Periodic Sets of Integers.
Proceedings of the Language and Automata Theory and Applications, 2011

2010
Invariant games.
Theor. Comput. Sci., 2010

Extensions and restrictions of Wythoff's game preserving its p positions.
J. Comb. Theory, Ser. A, 2010

Foreword.
RAIRO Theor. Informatics Appl., 2010

Multidimensional generalized automatic sequences and shape-symmetric morphic words.
Discret. Math., 2010

State Complexity of Testing Divisibility
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.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010

On the Periodicity of Morphic Words.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010

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

Representing Real Numbers in a Generalized Numeration Systems
CoRR, 2009

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

Syndeticity and independent substitutions.
Adv. Appl. Math., 2009

On the Recognizability of Self-generating Sets.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

2008
Preface to the special issue dedicated to combinatorics, automata and number theory.
Theor. Comput. Sci., 2008

A morphic approach to combinatorial games: the Tribonacci case.
RAIRO Theor. Informatics Appl., 2008

Syntactical and automatic properties of sets of polynomials over finite fields.
Finite Fields Their Appl., 2008

A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems.
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

2007
About frequencies of letters in generalized automatic sequences.
Theor. Comput. Sci., 2007

Distribution of Additive Functions with Respect to Numeration Systems on Regular Languages.
Theory Comput. Syst., 2007

Odometers on Regular Languages.
Theory Comput. Syst., 2007

Foreword to the Special Issue Dedicated to the 10th "Journées Montoises d'Informatique Théorique".
Discret. Math. Theor. Comput. Sci., 2007

Abstract numeration systems on bounded languages and multiplication by a constant
CoRR, 2007

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

2005
Abstract Numeration Systems and Tilings.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2004
Characterizing Simpler Recognizable Sets of Integers.
Studia Logica, 2004

Real numbers having ultimately periodic representations in abstract numeration systems.
Inf. Comput., 2004

Decidability questions related to abstract numeration systems.
Discret. Math., 2004

2003
The commutative closure of a binary slip-language is context-free: a new proof.
Discret. Appl. Math., 2003

2002
On the Representation of Real Numbers Using Regular Languages.
Theory Comput. Syst., 2002

More on Generalized Automatic Sequences.
J. Autom. Lang. Comb., 2002

Construction of regular languages and recognizability of polynomials.
Discret. Math., 2002

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

Numeration Systems on a Regular Language.
Theory Comput. Syst., 2001

Towards a characterization of the star-free sets of integers
CoRR, 2001

2000
Generalization of automatic sequences for numeration systems on a regular language.
Theor. Comput. Sci., 2000


  Loading...