Hence weighted c-regular expressions and weighted m-automata are clearly equivalent in the unary case.
it is possible to convert a unary weighted c-regular expression α to an equivalent weighted m-automaton A(α), using the McNaughton-Yamada construction recalled earlier.