6 citations · 20 across the 10 of their papers we have counts for
3 papers · 1 filter
Morphisms and minimisation of weighted automata
Sylvain Lombardy, Jacques Sakarovitch
This paper studies the algorithms for the minimisation of weighted automata. It starts with the definition of morphisms-which generalises and unifies the notion of bisimulation to…
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…
On the enumerating series of an abstract numeration system
Pierre-Yves Angrand, Jacques Sakarovitch
It is known that any rational abstract numeration system is faithfully, and effectively, represented by an N-rational series. A simple proof of this result is given which yields a…