Victor Marsault

activity

20122026

most citedRel: A Programming Language for Relational Data

8 citations · 24 across the 19 of their papers we have counts for

collaborators

Showing 2017Show all

3 papers · 1 filter

cs.FL2017★ 1 cited

An efficient algorithm to decide periodicity of $b$ -recognisable sets using LSDF convention

Victor Marsault

Let $b$ be an integer strictly greater than $1$ . Each set of nonnegative integers is represented in base $b$ by a language over ${0, 1, \dots, b - 1}$ . The set is said to be $b$ -…

cs.DM2017

On subtrees of the representation tree in rational base numeration systems

Shigeki Akiyama, Victor Marsault, Jacques Sakarovitch

Every rational number p/q defines a rational base numeration system in which every integer has a unique finite representation, up to leading zeroes. This work is a contribution to…

cs.FL2017

An efficient algorithm to decide periodicity of b-recognisable sets using MSDF convention

Bernard Boigelot, Isabelle Mainz, Victor Marsault +1

Given an integer base $b > 1$ , a set of integers is represented in base $b$ by a language over ${0, 1, ..., b - 1}$ . The set is said to be $b$ -recognisable if its representation is a re…

An efficient algorithm to decide periodicity of b-recognisable sets using LSDF convention

On subtrees of the representation tree in rational base numeration systems

An efficient algorithm to decide periodicity of b-recognisable sets using MSDF convention

An efficient algorithm to decide periodicity of $b$ -recognisable sets using LSDF convention