Publications and communications of Emilie Charlier

Charlier, E., Cisternino, C., Masáková, Z., & Pelantová, E. (In press). Spectrum, algebraicity and normalization in alternate bases. Journal of Number Theory.

Kreczman, S., & Charlier, E. (04 April 2023). Régularité de langages générés par un système de numération glouton. Poster session presented at Journées Nationales de l’Informatique Mathématique, Paris, France.

Charlier, E., Cisternino, C., & Dajani, K. (2023). Dynamical behavior of alternate base expansions. Ergodic Theory and Dynamical Systems, 43, 827-860. doi:10.1017/etds.2021.161

Charlier, E. (15 December 2022). Non-canonical Bertrand numeration systems. Paper presented at Séminaire de théorie des nombres de Nancy, Nancy, France.

Charlier, E., Cisternino, C., & Stipulanti, M. (May 2022). A full characterization of Bertrand numeration systems. Lecture Notes in Computer Science, 13257, 102-114.

Charlier, E., Cisternino, C., & Stipulanti, M. (March 2022). Regular sequences and synchronized sequences in abstract numeration systems. European Journal of Combinatorics, 101, 103475. doi:10.1016/j.ejc.2021.103475

Charlier, E. (2022). Spectrum, algebraicity and normalization in alternate bases. Paper presented at One World Numeration Seminar.

Charlier, E. (2022). A full characterization of Bertrand numeration systems. Paper presented at Séminaire du GT de combinatoire et interactions du LaBRI.

Charlier, E., Cisternino, C., & Kreczman, S. (2022). On periodic alternate base expansions. Eprint/Working paper retrieved from https://orbi.uliege.be/2268/292097.

Charlier, E., Massuir, A., Rigo, M., & Rowland, E. (2022). Ultimate periodicity problem for linear numeration systems. International Journal of Algebra and Computation, 32, 561-596. doi:10.1142/S0218196722500254

Charlier, E., & Cisternino, C. (2021). Expansions in Cantor real bases. Monatshefte für Mathematik, 195, 585–610. doi:10.1007/s00605-021-01598-6

Charlier, E., Cisternino, C., & Massuir, A. (2021). Minimal automaton for multiplying and translating the Thue-Morse set. Electronic Journal of Combinatorics, 28 (P3.12), 36. doi:10.37236/9068

Charlier, E., Cisternino, C., & Stipulanti, M. (2021). Robustness of Pisot-regular sequences. Advances in Applied Mathematics, 125, 102151. doi:10.1016/j.aam.2020.102151

Charlier, E. (23 November 2020). Regular sequences in abstract numeration systems. Paper presented at One World Seminar on Combinatorics on Words.

Charlier, E., Puzynina, S., & Vandomme, E. (2020). Recurrence along directions in multidimensional words. Discrete Mathematics, 343, 23. doi:10.1016/j.disc.2020.112006

Charlier, E., Cisternino, C., & Massuir, A. (18 September 2019). State Complexity of the Multiples of the Thue-Morse Set. Electronic Proceedings in Theoretical Computer Science, 305, 34-49. doi:10.4204/EPTCS.305.3

Charlier, E. (July 2019). Decidability through first-order logic and regular sequences. Paper presented at Dyadisc3: Decidability and dynamical systems.

Charlier, E., Philibert, M., & Stipulanti, M. (2019). Nyldon words. Journal of Combinatorial Theory. Series A, 167, 60-90. doi:10.1016/j.jcta.2019.04.002

Charlier, E., Puzynina, S., & Vandomme, E. (2019). Recurrence in multidimensional words. Lecture Notes in Computer Science, 11417, 397-408. doi:10.1007/978-3-030-13435-8_29

Charlier, E. (February 2018). Nyldon words. Paper presented at Workshop on Words and Complexity, Lyon, France.

Charlier, E. (2018). Nyldon words. In Actes des 17èmes Journées Montoises d'Informatique Théorique.

Charlier, E. (2018). First-order Logic and Numeration Systems. In Sequences, Groups, and Number Theory. Birkhauser/Springer. doi:10.1007/978-3-319-69152-7_3

Charlier, E., Ernst, M., Esser, C., Haine, Y., Lacroix, A., Leroy, J., Raskin, J., & Swan, Y. (Eds.). (2018). MATh.en.JEANS. MATh.en.JEANS.be.

Charlier, E., Leroy, J., & Rigo, M. (Eds.). (2018). Special issue dedicated to the 16th "Journées Montoises d'Informatique Théorique". EDP Sciences.

Charlier, E., & Steiner, W. (2018). Permutations and negative beta-shifts. International Journal of Foundations of Computer Science, 29 (5), 721-740. doi:10.1142/S0129054118420029

Charlier, E. (September 2017). Permutation groups and the Morse-Hedlund Theorem. Paper presented at Workshop "Ergodic Theory & Symbolic Dynamics".

Charlier, E., Leroy, J., & Rigo, M. (2017). Preface. In Developments in Language Theory. Springer Verlag. doi:10.1007/978-3-319-62809-7

Charlier, E. (2017). Analogues of Cobham's theorem in three different areas of mathematics. Paper presented at Séminaire cristolien d'analyse multifractale, Créteil, France.

Charlier, E., Leroy, J., & Rigo, M. (2017). Foreword to the special issue dedicated to the sixteenth "Journées Montoises d'Informatique Théorique". In special issue RAIRO ITA (pp. 167). EDP Sciences. doi:10.1051/ita/2018001

Charlier, E., Leroy, J., & Rigo, M. (Eds.). (2017). Developments in Language Theory. Berlin, Germany: Springer.

Charlier, E., Puzynina, S., & Zamboni, L. (2017). On a group theoretic generalization of the Morse-Hedlund theorem. Proceedings of the American Mathematical Society, 145 (8), 3381–3394. doi:10.1090/proc/13589

Charlier, E. (November 2016). Logic, Decidability and Numeration Systems. Paper presented at Combinatorics, Automata and Number Theory (CANT).

Charlier, E., Leroy, J., & Rigo, M. (01 July 2016). Asymptotic properties of free monoid morphisms. Linear Algebra and its Applications, 500, 119-148. doi:10.1016/j.laa.2016.02.030

Charlier, E., & Steiner, W. (2016). Permutations and negative beta-shifts. In Actes de Numeration 2016.

Charlier, E. (2016). Permutations and shifts. Lecture Notes in Computer Science, 9840.

Charlier, E., Harju, T., Puzynina, S., & Zamboni, L. (2016). Abelian bordered factors and periodicity. European Journal of Combinatorics, 51, 407-418. doi:10.1016/j.ejc.2015.07.003

Charlier, E., Leroy, J., & Rigo, M. (2015). An analogue of Cobham's theorem for graph directed iterated function systems. Advances in Mathematics, 280, 86-120. doi:10.1016/j.aim.2015.04.008

Charlier, E., Kamae, T., Puzynina, S., & Zamboni, L. (November 2014). Infinite self-shuffling words. Journal of Combinatorial Theory. Series A, 128, 1-40. doi:10.1016/j.jcta.2014.07.008

Charlier, E., Harju, T., Puzynina, S., & Zamboni, L. (2014). Abelian bordered factors and periodicity. In Actes des Journées Montoises d'Informatique Théorique.

Charlier, E., & Honkala, J. (2014). The freeness problem for products of matrices defined on bounded languages. In Actes des Journées Montoises d'Informatique Théorique.

Charlier, E. (January 2014). Abelian borders and periodicity. Paper presented at Discrete Mathematics Day.

Charlier, E., & Honkala, J. (2014). The freeness problem over matrix semigroups and bounded languages. Information and Computation, 237, 243-256. doi:10.1016/j.ic.2014.03.001

Charlier, E., Domaratzki, M., Harju, T., & Shallit, J. (June 2013). Composition and orbits of language operations: finiteness and upper bounds. International Journal of Computer Mathematics, 90 (6), 1171-1196. doi:10.1080/00207160.2012.681305

Charlier, E. (April 2013). Self-shuffling words. Paper presented at Workshop on challenges on combinatorics on words, Toronto, Canada.

Charlier, E., Kamae, T., Puzynina, S., & Zamboni, L. (2013). Self-shuffling words. Lecture Notes in Computer Science, 7966, 113-124. doi:10.1007/978-3-642-39212-2_13

Charlier, E. (August 2012). Automates et systèmes de numération. Paper presented at Brussels Summer School of Mathematics of ULB, Bruxelles, Belgium.

Charlier, E. (July 2012). A decision problem for ultimate periodicity in non-standard numeration systems. Paper presented at Journées de l'ANR SubTile, Decidability problems for substitutive sequences, tilings and numerations, Amiens, France.

Charlier, E. (June 2012). Syntactical complexity of periodic sets. Paper presented at First Joint Conference of the Belgian, Royal Spanish and Luxembourg Mathematical Societies, Liege, Belgium.

Charlier, E. (June 2012). Monoïde syntaxique et numérations. Paper presented at Journées Machines à états finis et Combinatoire, 5èmes Journées du groupe de travail SDA2, Rouen, France.

Charlier, E. (May 2012). An introduction to abstract numeration systems. Paper presented at Séminaire de vérification de l'ULB, Bruxelles, Belgium.

Charlier, E. (May 2012). Abstract numeration systems. Paper presented at Combinatorics on words colloquium of the University of Turku, Turku, Finland.

Charlier, E. (April 2012). Ensembles reconnaissables de rationnels. Paper presented at Groupe de travail en combinatoire des mots, Saint-Dié-des-Vosges, France.

Charlier, E., Lacroix, A., & Rampersad, N. (2012). Multi-dimensional sets recognizable in all abstract numeration systems. RAIRO: Informatique Théorique et Applications, 46 (1), 51-65. doi:10.1051/ita/2011112

Charlier, E., Rampersad, N., & Shallit, J. (2012). Enumeration and decidable properties of automatic sequences. International Journal of Foundations of Computer Science, 23 (5), 1035-1066. doi:10.1142/S0129054112400448

Charlier, E. (August 2011). Orbits of language operations: finiteness and upper bounds. Paper presented at Theory Seminar of the University of Toronto, Toronto, Canada.

Charlier, E. (July 2011). Enumeration and decidable properties of automatic sequences. Paper presented at International Conference on Applied MAthematics, Modeling, and Computanional Science (Laurier Centennial Conference), Waterloo, Canada.

Charlier, E., Rampersad, N., & Shallit, J. (2011). Enumeration and decidable properties of automatic sequences. In Actes de Numération 2011.

Charlier, E. (May 2011). Finite orbits of language operations. Paper presented at Algorithms and Complexity Seminar of the University of Waterloo, Waterloo, Canada.

Charlier, E. (April 2011). Abstract numeration systems or decimation of languages. Paper presented at Languages and Automata Theory Seminar of the University of Waterloo, Waterloo, Canada.

Charlier, E. (January 2011). A numeration point of view on the HD0L periodicity problem. Paper presented at Languages and Automata Theory Seminar of the University of Waterloo, Waterloo, Canada.

Charlier, E., Domaratzski, M., Harju, T., & Shallit, J. (2011). Finite orbits of language operations. Lecture Notes in Computer Science, 6638, 204-215. doi:10.1007/978-3-642-21254-3_15

Charlier, E., Le Gonidec, M., & Rigo, M. (2011). Representing real numbers in a generalized numeration system. Journal of Computer and System Sciences, 77, 743-759. doi:10.1016/j.jcss.2010.07.002

Charlier, E., & Rampersad, N. (2011). The growth function of S-recognizable sets. Theoretical Computer Science, 412 (39), 5400-5408. doi:10.1016/j.tcs.2011.05.057

Charlier, E., Rampersad, N., Rigo, M., & Waxweiler, L. (2011). The minimal automaton recognizing mN in a linear numeration system. Integers, 11B (A4), 1-24.

Charlier, E., Rampersad, N., & Shallit, J. (2011). Enumeration and decidable properties of automatic sequences. Lecture Notes in Computer Science, 6795, 165-179. doi:10.1007/978-3-642-22321-1_15

Charlier, E. (December 2010). S-automatic sets. Paper presented at Séminaire de combinatoire et d'informatique mathématique du LaCIM (UQÀM), Montréal, Canada.

Charlier, E. (October 2010). Criteria for recognizability in abstract numeration systems. Paper presented at Languages and Automata Theory Seminar of the University of Waterloo, Waterloo, Canada.

Charlier, E., Rampersad, N., Rigo, M., & Waxweiler, L. (2010). Structure of the minimal automaton of a numeration language. In Actes de LaCIM 2010.

Charlier, E., Rampersad, N., Rigo, M., & Waxweiler, L. (2010). State complexity of testing divisibility. In P. G. McQuillan, Ian (Ed.), Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems (pp. 48-57). doi:10.4204/EPTCS.31

Charlier, E. (June 2010). Representing real numbers in a generalized numeration system. Paper presented at Numeration 2010, Leiden, Netherlands.

Charlier, E., Kärki, T., & Rigo, M. (2010). Multidimensional generalized automatic sequences and shape-symmetric morphic words. Discrete Mathematics, 310, 1238-1252. doi:10.1016/j.disc.2009.12.002

Charlier, E., Rampersad, N., Rigo, M., & Waxweiler, L. (2010). Structure of the minimal automaton of a numeration language and applications to state complexity. In Actes des Journées Montoises d'Informatique Théorique.

Charlier, E. (2009). Abstract Numeration Systems : Recognizability, Decidability, Multidimensional S-Automatic Words, and Real Numbers. Unpublished doctoral thesis, ULiège - Université de Liège.
Jury: Rigo, M. (Promotor), Lecomte, P., Berthé, V., Boigelot, B., Sakarovitch, J., ... Hansoul, G.

Bell, J., Charlier, E., Fraenkel, A., & Rigo, M. (2009). A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems. International Journal of Algebra and Computation, 19, 809-839. doi:10.1142/S0218196709005330

Charlier, E., Kärki, T., & Rigo, M. (2009). Multidimensional generalized automatic sequences and shape-symmetric morphic words. In Proceedings of AutoMathA.

Charlier, E., Kärki, T., & Rigo, M. (2009). A characterization of multidimensional S-automatic sequences. In Actes des rencontres du CIRM, 1 (pp. 23-28). doi:10.5802/acirm.5

Charlier, E. (December 2008). A decision problem for ultimately periodic sets in non-standard numeration systems. Paper presented at Séminaire du groupe de recherche "Large graphs and Networks" de l'UCL, Louvain-la-Neuve, Belgium.

Charlier, E. (May 2008). A decision problem for ultimately periodic sets in non-standard numeration systems. Paper presented at Journées de Numération, Prague, Czechia.

Charlier, E. (February 2008). Systèmes de numération. Paper presented at Séminaire de Master 2 en Mathématiques Discrètes de l'Université de Liège, Liège, Belgium.

Charlier, E., & Rigo, M. (2008). A decision problem for ultimately periodic sets in non-standard numeration systems. In Actes des Journées Montoises d'Informatique Théorique.

Charlier, E., & Rigo, M. (2008). A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems. Lecture Notes in Computer Science, 5162, 241-252. doi:10.1007/978-3-540-85238-4_19

Charlier, E., Rigo, M., & Steiner, W. (2008). Abstract numeration systems on bounded languages and multiplication by a constant. Integers, 8 (1-A35), 1-19.

Charlier, E. (May 2007). Abstract numeration systems. Paper presented at Spring School and Workshop on Combinatorics on Words, Herbertov, Czechia.

Charlier, E. (April 2007). Structural properties of bounded languages with respect to multiplication by a constant. Paper presented at Journées de Numération, Graz, Austria.

Charlier, E. (January 2007). Abstract numeration systems and recognizability. Paper presented at Rencontres Arithmétique de l'Informatique Mathématique, Montpellier, France.

Charlier, E. (October 2006). Strutural properties of bounded languages with respect to multiplication by a constant. Paper presented at Interregional Colloquium of Mathematics, Trèves, Germany.

Charlier, E. (2006). Conservation du caractère reconnaissable par opérations arithmétiques dans un système de numération abstrait. Unpublished DEA/DES thesis, ULiège - Université de Liège.
Jury: Rigo, M. (Promotor), Wolper, P., Hansoul, G., ... Lecomte, P.

Charlier, E., & Rigo, M. (2006). Structural properties of bounded languages with respect to multiplication by a constant. In Actes des Journées Montoises d'Informatique Théorique.

Charlier, E. (12 September 2005). Multiplication by a Constant and Recognizability in an Abstract Numeration System. Poster session presented at Belgian Mathematical Society PhD-Day, Bruxelles, Belgium.

Charlier, E. (April 2005). Systèmes de numération et reconnaissabilité. Paper presented at Séminaire interuniversitaire de logique mathématique, Bruxelles (ULB), Belgium.

Charlier, E. (2004). Frames d'exponentielles. Unpublished master thesis, ULiège - Université de Liège.
Jury: Bastin, F. (Promotor).