Émilie Charlier

Orcid: 0000-0002-5789-2674

Affiliations:
  • Université de Liège, Belgium


According to our database1, Émilie Charlier authored at least 36 papers between 2007 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Alternate Base Numeration Systems.
Proceedings of the Combinatorics on Words - 14th International Conference, 2023

2022
Ultimate periodicity problem for linear numeration systems.
Int. J. Algebra Comput., 2022

Regular sequences and synchronized sequences in abstract numeration systems.
Eur. J. Comb., 2022

Spectrum, algebraicity and normalization in alternate bases.
CoRR, 2022

A Full Characterization of Bertrand Numeration Systems.
Proceedings of the Developments in Language Theory - 26th International Conference, 2022

2021
Dynamical behavior of alternate base expansions.
CoRR, 2021

Expansions in Cantor real bases.
CoRR, 2021

Minimal Automaton for Multiplying and Translating the Thue-Morse Set.
Electron. J. Comb., 2021

Robustness of Pisot-regular sequences.
Adv. Appl. Math., 2021

2020
Recurrence along directions in multidimensional words.
Discret. Math., 2020

2019
Nyldon words.
J. Comb. Theory A, 2019

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

State Complexity of the Multiples of the Thue-Morse Set.
Proceedings of the Proceedings Tenth International Symposium on Games, 2019

Recurrence in Multidimensional Words.
Proceedings of the Language and Automata Theory and Applications, 2019

2018
Permutations and Negative Beta-Shifts.
Int. J. Found. Comput. Sci., 2018

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

2016
Abelian bordered factors and periodicity.
Eur. J. Comb., 2016

2015
Asymptotic properties of free monoid morphisms.
CoRR, 2015

2014
Infinite self-shuffling words.
J. Comb. Theory A, 2014

The freeness problem over matrix semigroups and bounded languages.
Inf. Comput., 2014

2013
Composition and orbits of language operations: finiteness and upper bounds.
Int. J. Comput. Math., 2013

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

Self-shuffling Words.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012
Multi-dimensional sets recognizable in all abstract numeration systems.
RAIRO Theor. Informatics Appl., 2012

Enumeration and Decidable Properties of Automatic Sequences.
Int. J. Found. Comput. Sci., 2012

2011
The growth function of S-recognizable sets.
Theor. Comput. Sci., 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

Finite Orbits of Language Operations.
Proceedings of the Language and Automata Theory and Applications, 2011

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

2009
A Decision Problem for Ultimately Periodic Sets in Nonstandard Numeration Systems.
Int. J. Algebra Comput., 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

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

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


  Loading...