It is decidable whether or not a permutation-free morphism is an l code

We show that it is decidable whether or not a permutation-free morphism is an L code. We also show that the degree of L-ambiguity with respect to a set of words can be computed effectively.