In this talk I will present how we derived a sound and complete axiomatization of language equivalence for non-deterministic and weighted automata from a calculus of regular expressions for (weighted) bisimulation.