6 citations · 8 across the 2 of their papers we have counts for
2 papers
cs.FL2014★ 2 cited
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…
cs.FL2010★ 6 cited
On the Minimal Uncompletable Word Problem
Gabriele Fici, Elena V. Pribavkina, Jacques Sakarovitch
Let S be a finite set of words over an alphabet Sigma. The set S is said to be complete if every word w over the alphabet Sigma is a factor of some element of S*, i.e. w belongs to…