We now define \(K\) -weighted language equivalence \(\sim _l\)  for \(K\) -weighted automata
and show that \(K\) -weighted bisimilarity is a refinement of \(K\) -weighted
language equivalence. The proof is from [1]}.
