Showing cs.FLShow all
3 papers · 1 filter
cs.FL2011★ 2 cited
Finite Orbits of Language Operations
E. Charlier, M. Domaratzki, T. Harju +1
We consider a set of natural operations on languages, and prove that the orbit of any language L under the monoid generated by this set is finite and bounded, independently of L. T…
cs.FL2010★ 2 cited
The growth function of S-recognizable sets
Emilie Charlier, Narad Rampersad
A set 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…
cs.FL2010
Multi-dimensional sets recognizable in all abstract numeration systems
Emilie Charlier, Anne Lacroix, Narad Rampersad
We prove that the subsets of N^d that are S-recognizable for all abstract numeration systems S are exactly the 1-recognizable sets. This generalizes a result of Lecomte and Rigo in…