#### Filter Results:

- Full text PDF available (12)

#### Publication Year

2007

2018

- This year (2)
- Last 5 years (11)
- Last 10 years (24)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Émilie Charlier, Narad Rampersad, Jeffrey Shallit
- Int. J. Found. Comput. Sci.
- 2012

- Émilie Charlier, Teturo Kamae, Svetlana Puzynina, Luca Q. Zamboni
- ICALP
- 2013

In this paper we introduce and study a new property of infinite words which is invariant under the action of a morphism: We say an infinite word x ∈ A, defined over a finite alphabet A, is… (More)

- Émilie Charlier, Juha Honkala
- Inf. Comput.
- 2014

We study the freeness problem for matrix semigroups. We show that the freeness problem is decidable for upper-triangular 2 × 2 matrices with rational entries when the products are restricted to… (More)

- Émilie Charlier, Teturo Kamae, Svetlana Puzynina, Luca Q. Zamboni
- J. Comb. Theory, Ser. A
- 2014

In this paper we introduce and study a new property of infinite words: An infinite word x ∈ A, with values in a finite set A, is said to be k-self-shuffling (k ≥ 2) if x admits factorizations: x = ∏∞… (More)

- Émilie Charlier, Narad Rampersad
- Theor. Comput. Sci.
- 2011

A set X ⊆ N is S-recognizable for an abstract numeration system S if the set rep S (X) of its representations is accepted by a finite automaton. We show that the growth function of an S-recognizable… (More)

- Émilie Charlier, Michel Rigo
- MFCS
- 2008

Numeration Systems Non standard Numeration Systems Definition A numeration system is given by a (strictly) increasing sequence U = (Ui )i≥0 of integers such that U0 = 1 and CU := supi≥0⌈Ui+1/Ui⌉ is… (More)

- Émilie Charlier, Tomi Kärki, Michel Rigo
- Discrete Mathematics
- 2010

An infinite word is S-automatic if, for all n ≥ 0, its (n+1)st letter is the output of a deterministic automaton fed with the representation of n in the considered numeration system S. In this paper,… (More)

We study the structure of automata accepting the greedy representations of N in a wide class of numeration systems. We describe the conditions under which such automata can have more than one… (More)

- Émilie Charlier, Marion Le Gonidec, Michel Rigo
- J. Comput. Syst. Sci.
- 2011

numeration systems An abstract numeration system (ANS) is given by a triplet S = (L,Σ, <) where L is a regular language over a totally ordered alphabet (Σ, <). By enumerating the words in L with… (More)

- Émilie Charlier, Anne Lacroix, Narad Rampersad
- RAIRO - Theor. Inf. and Applic.
- 2012

numeration systems An abstract numeration system is a triple S = (L,Σ, <) where L is an infinite regular language over the totally ordered alphabet (Σ, <) By enumerating words of L in the radix order… (More)