| Publication | Date of Publication | Type |
|---|
| Automatic abelian complexities of Parikh-collinear fixed points | 2025-01-13 | Paper |
| On extended boundary sequences of morphic and Sturmian words | 2024-08-06 | Paper |
| Characterizations of families of morphisms and words via binomial complexities | 2024-03-26 | Paper |
| On extended boundary sequences of morphic and Sturmian words | 2024-02-19 | Paper |
| Reconstructing Words from Right-Bounded-Block Words | 2023-08-15 | Paper |
| Automaticity and Parikh-Collinear Morphisms | 2023-07-25 | Paper |
| Automatic sequences: from rational bases to trees | 2023-05-30 | Paper |
| On digital sequences associated with Pascal's triangle | 2023-04-05 | Paper |
| Reconstructing Words from Right-Bounded-Block Words | 2022-10-13 | Paper |
| Binomial complexities and Parikh-collinear morphisms | 2022-08-11 | Paper |
| Ultimate periodicity problem for linear numeration systems | 2022-05-11 | Paper |
| On digital sequences associated with Pascal's triangle | 2022-01-17 | Paper |
| Revisiting regular sequences in light of rational base numeration systems | 2022-01-13 | Paper |
| On Cobham's theorem | 2021-11-12 | Paper |
| Revisiting regular sequences in light of rational base numeration systems | 2021-03-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4964009 | 2021-02-24 | Paper |
| Taking-and-merging games as rewrite games | 2021-01-05 | Paper |
| From Combinatorial Games to Shape-Symmetric Morphisms | 2020-12-18 | Paper |
| The binomial equivalence classes of finite words | 2020-10-14 | Paper |
| Computing the \(k\)-binomial complexity of the Thue-Morse word | 2020-09-07 | Paper |
| The carry propagation of the successor function | 2020-09-01 | Paper |
| An efficient algorithm to decide periodicity of b-recognisable sets using MSDF convention | 2020-05-27 | Paper |
| Templates for the \(k\)-binomial complexity of the Tribonacci word | 2019-12-17 | Paper |
| Templates for the \(k\)-binomial complexity of the Tribonacci word | 2019-11-06 | Paper |
| Computing the \(k\)-binomial complexity of the Thue-Morse word | 2019-10-15 | Paper |
| Book review of: Y. Yang, A concise text on advanced linear algebra | 2019-08-15 | Paper |
| Book review of: R. P. Stanley, Catalan numbers | 2019-08-15 | Paper |
| Book review of: J. L. Rhodes, Applications of automata theory and algebra. Via the mathematical theory of complexity to biology, physics, psychology, philosophy, and games | 2019-08-15 | Paper |
| Book review of: B. P. Katz and M. Starbird, Distilling ideas. An introduction to mathematical thinking: graphs, groups, calculus | 2019-08-15 | Paper |
| Automatic sequences based on Parry or Bertrand numeration systems | 2019-07-11 | Paper |
| Counting Subwords Occurrences in Base-b Expansions | 2019-06-21 | Paper |
| Preliminaries | 2019-02-19 | Paper |
| General Framework | 2019-01-24 | Paper |
| Computing the $k$-binomial complexity of the Thue--Morse word | 2018-12-18 | Paper |
| A Characterization of Multidimensional <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>S</mml:mi></mml:math>-Automatic Sequences | 2018-09-18 | Paper |
| Behavior of digital sequences through exotic numeration systems | 2017-04-10 | Paper |
| Deciding game invariance | 2017-03-16 | Paper |
| Counting the number of non-zero coefficients in rows of generalized Pascal triangles | 2017-02-27 | Paper |
| Relations on words | 2017-01-18 | Paper |
| Advanced Graph Theory and Combinatorics | 2017-01-10 | Paper |
| Nonhomogeneous Beatty sequences leading to invariant games | 2016-09-09 | Paper |
| Generalized Pascal triangle for binomial coefficients of words | 2016-09-06 | Paper |
| Defining Multiplication in Some Additive Expansions of Polynomial Rings | 2016-06-24 | Paper |
| Asymptotic properties of free monoid morphisms | 2016-04-20 | Paper |
| Book review of: A. F. Beardon, Creative mathematics. A gateway to research | 2015-11-02 | Paper |
| Another generalization of abelian equivalence: binomial complexity of infinite words | 2015-09-16 | Paper |
| Formal Languages, Automata and Numeration Systems 2 | 2015-06-01 | Paper |
| An analogue of Cobham's theorem for graph directed iterated function systems | 2015-05-29 | Paper |
| ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING) | 2015-04-23 | Paper |
| Avoiding 2-binomial squares and cubes | 2015-02-24 | Paper |
| A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences | 2015-02-19 | Paper |
| Formal Languages, Automata and Numeration Systems 1 | 2015-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5404285 | 2014-03-24 | Paper |
| A note on abelian returns in rotation words | 2014-03-13 | Paper |
| Invariant games and non-homogeneous Beatty sequences | 2013-12-08 | Paper |
| The minimal automaton recognizing \(m\mathbb N\) in a linear numeration system | 2013-10-25 | Paper |
| Another Generalization of Abelian Equivalence: Binomial Complexity of Infinite Words | 2013-09-20 | Paper |
| On the Number of Abelian Bordered Words | 2013-06-28 | Paper |
| Multidimensional extension of the Morse-Hedlund theorem | 2012-12-03 | Paper |
| Logical characterization of recognizable sets of polynomials over a finite field | 2012-08-29 | Paper |
| Syntactic complexity of ultimately periodic sets of integers and application to a decision procedure | 2012-06-20 | Paper |
| Syntactic Complexity of Ultimately Periodic Sets of Integers | 2011-06-03 | Paper |
| Representing real numbers in a generalized numeration system | 2011-04-28 | Paper |
| Abstract numeration systems | 2011-04-18 | Paper |
| On the Periodicity of Morphic Words | 2010-08-31 | Paper |
| Numeration Systems: A Link between Number Theory and Formal Language Theory | 2010-08-31 | Paper |
| Invariant games | 2010-08-11 | Paper |
| Multidimensional generalized automatic sequences and shape-symmetric morphic words | 2010-04-27 | Paper |
| Extensions and restrictions of Wythoff's game preserving its \(\mathcal P\) positions | 2010-04-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3550114 | 2010-03-30 | Paper |
| A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS | 2009-11-09 | Paper |
| On the Recognizability of Self-generating Sets | 2009-10-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396580 | 2009-09-19 | Paper |
| About frequencies of letters in generalized automatic sequences | 2009-06-22 | Paper |
| Cubic pisot unit combinatorial games | 2009-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3628993 | 2009-05-26 | Paper |
| A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems | 2009-02-03 | Paper |
| Syndeticity and independent substitutions | 2009-01-20 | Paper |
| A morphic approach to combinatorial games: the Tribonacci case | 2008-07-29 | Paper |
| Syntactical and automatic properties of sets of polynomials over finite fields | 2008-02-06 | Paper |
| Distribution of additive functions with respect to numeration systems on regular languages | 2007-03-12 | Paper |
| Odometers on regular languages | 2007-02-14 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5694012 | 2005-09-29 | Paper |
| Abstract \(\beta\)-expansions and ultimately periodic representations | 2005-09-15 | Paper |
| Decidability questions related to abstract numeration systems | 2004-08-19 | Paper |
| Real numbers having ultimately periodic representations in abstract numeration systems | 2004-08-06 | Paper |
| Characterizing simpler recognizable sets of integers | 2004-08-06 | Paper |
| The commutative closure of a binary slip-language is context-free: A new proof. | 2003-11-20 | Paper |
| Additive functions with respect to numeration systems on regular languages | 2003-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708608 | 2003-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4807827 | 2003-05-26 | Paper |
| Construction of regular languages and recognizability of polynomials | 2002-08-29 | Paper |
| On the representation of real numbers using regular languages | 2002-05-30 | Paper |
| Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series | 2002-03-03 | Paper |
| Numeration systems on a regular language | 2001-04-17 | Paper |
| Generalization of automatic sequences for numeration systems on a regular language | 2000-08-21 | Paper |
| q-Parikh Matrices and q-deformed binomial coefficients of words | N/A | Paper |
| Introducing q-deformed binomial coefficients of words | N/A | Paper |
