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

Abstract

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.

Keywords:

• Code
• L code
• ambiguity
• elementary morphism

C.R. Categories:

• F.4.2 [Parallel rewriting systems; Decision problems].