| Publication | Date of Publication | Type |
|---|
Automatic abelian complexities of Parikh-collinear fixed points
Theory of Computing Systems | 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
European Journal of Combinatorics | 2024-03-26 | Paper |
On extended boundary sequences of morphic and Sturmian words
The Electronic Journal of Combinatorics | 2024-02-19 | Paper |
Reconstructing Words from Right-Bounded-Block Words
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
Automaticity and Parikh-Collinear Morphisms
Lecture Notes in Computer Science | 2023-07-25 | Paper |
Automatic sequences: from rational bases to trees
Discrete Mathematics & Theoretical Computer Science | 2023-05-30 | Paper |
On digital sequences associated with Pascal's triangle
Aequationes Mathematicae | 2023-04-05 | Paper |
Reconstructing words from right-bounded-block words
Developments in Language Theory | 2022-10-13 | Paper |
Binomial complexities and Parikh-collinear morphisms
| 2022-08-11 | Paper |
Ultimate periodicity problem for linear numeration systems
International Journal of Algebra and Computation | 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
Discrete Mathematics | 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 |
scientific article; zbMATH DE number 7315090 (Why is no real title available?)
| 2021-02-24 | Paper |
Taking-and-merging games as rewrite games
| 2021-01-05 | Paper |
From combinatorial games to shape-symmetric morphisms
Lecture Notes in Mathematics | 2020-12-18 | Paper |
The binomial equivalence classes of finite words
International Journal of Algebra and Computation | 2020-10-14 | Paper |
Computing the \(k\)-binomial complexity of the Thue-Morse word
Journal of Combinatorial Theory. Series A | 2020-09-07 | Paper |
The carry propagation of the successor function
Advances in Applied Mathematics | 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
Advances in Applied Mathematics | 2019-12-17 | Paper |
Templates for the \(k\)-binomial complexity of the Tribonacci word
Lecture Notes in Computer Science | 2019-11-06 | Paper |
Computing the \(k\)-binomial complexity of the Thue-Morse word
Developments in Language Theory | 2019-10-15 | Paper |
Book review of: Y. Yang, A concise text on advanced linear algebra
Bulletin of the Belgian Mathematical Society - Simon Stevin | 2019-08-15 | Paper |
Book review of: R. P. Stanley, Catalan numbers
Bulletin of the Belgian Mathematical Society - Simon Stevin | 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
Bulletin of the Belgian Mathematical Society - Simon Stevin | 2019-08-15 | Paper |
Book review of: B. P. Katz and M. Starbird, Distilling ideas. An introduction to mathematical thinking: graphs, groups, calculus
Bulletin of the Belgian Mathematical Society - Simon Stevin | 2019-08-15 | Paper |
Automatic sequences based on Parry or Bertrand numeration systems
Advances in Applied Mathematics | 2019-07-11 | Paper |
Counting subword occurrences in base-\(b\) expansions
| 2019-06-21 | Paper |
Preliminaries [to: Combinatorics, words and symbolic dynamics]
Combinatorics, Words and Symbolic Dynamics | 2019-02-19 | Paper |
General framework
Trends in Mathematics | 2019-01-24 | Paper |
Computing the $k$-binomial complexity of the Thue--Morse word
| 2018-12-18 | Paper |
A characterization of multidimensional \(S\)-automatic sequences
Actes des rencontres du CIRM | 2018-09-18 | Paper |
Behavior of digital sequences through exotic numeration systems
The Electronic Journal of Combinatorics | 2017-04-10 | Paper |
Deciding game invariance
Information and Computation | 2017-03-16 | Paper |
Counting the number of non-zero coefficients in rows of generalized Pascal triangles
Discrete Mathematics | 2017-02-27 | Paper |
Relations on words
Indagationes Mathematicae. New Series | 2017-01-18 | Paper |
Advanced graph theory and combinatorics
| 2017-01-10 | Paper |
Nonhomogeneous Beatty sequences leading to invariant games
SIAM Journal on Discrete Mathematics | 2016-09-09 | Paper |
Generalized Pascal triangle for binomial coefficients of words
Advances in Applied Mathematics | 2016-09-06 | Paper |
Defining multiplication in some additive expansions of polynomial rings
Communications in Algebra | 2016-06-24 | Paper |
Asymptotic properties of free monoid morphisms
Linear Algebra and its Applications | 2016-04-20 | Paper |
Book review of: A. F. Beardon, Creative mathematics. A gateway to research
Bulletin of the Belgian Mathematical Society - Simon Stevin | 2015-11-02 | Paper |
Another generalization of abelian equivalence: binomial complexity of infinite words
Theoretical Computer Science | 2015-09-16 | Paper |
Formal languages, automata and numeration systems. Vol. 2. Applications to recognizability and decidability
| 2015-06-01 | Paper |
An analogue of Cobham's theorem for graph directed iterated function systems
Advances in Mathematics | 2015-05-29 | Paper |
On the number of abelian bordered words (with an example of automatic theorem-proving)
International Journal of Foundations of Computer Science | 2015-04-23 | Paper |
Avoiding 2-binomial squares and cubes
Theoretical Computer Science | 2015-02-24 | Paper |
A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences
The Electronic Journal of Combinatorics | 2015-02-19 | Paper |
Formal Languages, Automata and Numeration Systems 1
| 2015-01-07 | Paper |
scientific article; zbMATH DE number 6272378 (Why is no real title available?)
| 2014-03-24 | Paper |
A note on abelian returns in rotation words
Theoretical Computer Science | 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
Integers | 2013-10-25 | Paper |
Another generalization of abelian equivalence: binomial complexity of infinite words
Lecture Notes in Computer Science | 2013-09-20 | Paper |
On the number of abelian bordered words
Developments in Language Theory | 2013-06-28 | Paper |
Multidimensional extension of the Morse-Hedlund theorem
European Journal of Combinatorics | 2012-12-03 | Paper |
Logical characterization of recognizable sets of polynomials over a finite field
International Journal of Foundations of Computer Science | 2012-08-29 | Paper |
Syntactic complexity of ultimately periodic sets of integers and application to a decision procedure
Fundamenta Informaticae | 2012-06-20 | Paper |
Syntactic complexity of ultimately periodic sets of integers
Language and Automata Theory and Applications | 2011-06-03 | Paper |
Representing real numbers in a generalized numeration system
Journal of Computer and System Sciences | 2011-04-28 | Paper |
Abstract numeration systems
Combinatorics, Automata and Number Theory | 2011-04-18 | Paper |
On the periodicity of morphic words
Developments in Language Theory | 2010-08-31 | Paper |
Numeration systems: a link between number theory and formal language theory
Developments in Language Theory | 2010-08-31 | Paper |
Invariant games
Theoretical Computer Science | 2010-08-11 | Paper |
Multidimensional generalized automatic sequences and shape-symmetric morphic words
Discrete Mathematics | 2010-04-27 | Paper |
Extensions and restrictions of Wythoff's game preserving its \(\mathcal P\) positions
Journal of Combinatorial Theory. Series A | 2010-04-21 | Paper |
On the recognizability of self-generating sets
| 2010-03-30 | Paper |
A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS
International Journal of Algebra and Computation | 2009-11-09 | Paper |
On the Recognizability of Self-generating Sets
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
scientific article; zbMATH DE number 5605083 (Why is no real title available?)
| 2009-09-19 | Paper |
About frequencies of letters in generalized automatic sequences
Theoretical Computer Science | 2009-06-22 | Paper |
Cubic pisot unit combinatorial games
Monatshefte für Mathematik | 2009-06-22 | Paper |
Abstract numeration systems on bounded languages and multiplication by a constant
| 2009-05-26 | Paper |
A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Syndeticity and independent substitutions
Advances in Applied Mathematics | 2009-01-20 | Paper |
A morphic approach to combinatorial games: the Tribonacci case
RAIRO - Theoretical Informatics and Applications | 2008-07-29 | Paper |
Syntactical and automatic properties of sets of polynomials over finite fields
Finite Fields and their Applications | 2008-02-06 | Paper |
Distribution of additive functions with respect to numeration systems on regular languages
Theory of Computing Systems | 2007-03-12 | Paper |
Odometers on regular languages
Theory of Computing Systems | 2007-02-14 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
scientific article; zbMATH DE number 2210765 (Why is no real title available?)
| 2005-09-29 | Paper |
Abstract \(\beta\)-expansions and ultimately periodic representations
Journal de Théorie des Nombres de Bordeaux | 2005-09-15 | Paper |
Decidability questions related to abstract numeration systems
Discrete Mathematics | 2004-08-19 | Paper |
Real numbers having ultimately periodic representations in abstract numeration systems
Information and Computation | 2004-08-06 | Paper |
Characterizing simpler recognizable sets of integers
Studia Logica | 2004-08-06 | Paper |
The commutative closure of a binary slip-language is context-free: A new proof.
Discrete Applied Mathematics | 2003-11-20 | Paper |
Additive functions with respect to numeration systems on regular languages
Monatshefte für Mathematik | 2003-08-24 | Paper |
scientific article; zbMATH DE number 1929973 (Why is no real title available?)
| 2003-06-18 | Paper |
scientific article; zbMATH DE number 1916667 (Why is no real title available?)
| 2003-05-26 | Paper |
Construction of regular languages and recognizability of polynomials
Discrete Mathematics | 2002-08-29 | Paper |
On the representation of real numbers using regular languages
Theory of Computing Systems | 2002-05-30 | Paper |
Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series
Theoretical Computer Science | 2002-03-03 | Paper |
Numeration systems on a regular language
Theory of Computing Systems | 2001-04-17 | Paper |
Generalization of automatic sequences for numeration systems on a regular language
Theoretical Computer Science | 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 |
