8 citations · 24 across the 19 of their papers we have counts for
9 papers · 1 filter
Enumerating regular languages in radix order : Revisiting the Ackerman-Shallit algorithm
Nadime Francis, Victor Marsault
We consider the problem of enumerating a regular language in radix order, or more precisely, the equivalent problem of enumerating all words in of a given length in lexicog…
Taking-and-merging games as rewrite games
Eric Duchêne, Victor Marsault, Aline Parreau +1
This work is a contribution to the study of rewrite games. Positions are finite words, and the possible moves are defined by a finite number of local rewriting rules. We introduce…
An efficient algorithm to decide periodicity of -recognisable sets using LSDF convention
Victor Marsault
Let be an integer strictly greater than . Each set of nonnegative integers is represented in base by a language over . The set is said to be -…
An efficient algorithm to decide periodicity of b-recognisable sets using MSDF convention
Bernard Boigelot, Isabelle Mainz, Victor Marsault +1
Given an integer base , a set of integers is represented in base by a language over . The set is said to be -recognisable if its representation is a re…
Breadth-first serialisation of trees and rational languages
Victor Marsault, Jacques Sakarovitch
We present here the notion of breadth-first signature and its relationship with numeration system theory. It is the serialisation into an infinite word of an ordered infinite tree…
Rhythmic generation of infinite trees and languages
Victor Marsault, Jacques Sakarovitch
This work builds on the notion of breadth-first signature of infinite trees and (prefix-closed) languages introduced by the authors in a previous work. We focus here on periodic si…
Auto-similarity in rational base number systems
Shigeki Akiyama, Victor Marsault, Jacques Sakarovitch
This work is a contribution to the study of set of the representations of integers in a rational base number system. This prefix-closed subset of the free monoid is naturally repre…
Ultimate periodicity of b-recognisable sets : a quasilinear procedure
Victor Marsault, Jacques Sakarovitch
It is decidable if a set of numbers, whose representation in a base b is a regular language, is ultimately periodic. This was established by Honkala in 1986. We give here a structu…
On sets of numbers rationally represented in a rational base number system
Victor Marsault, Jacques Sakarovitch
In this work, it is proved that a set of numbers closed under addition and whose representations in a rational base numeration system is a rational language is not a finitely gener…