On Alphabetic Coding for Superwords

Resumo

We consider alphabetic coding of superwords. We establish an unambiguity coding criterion for the cases of finite and infinite codes. We prove that in the case of an infinite code the ambiguity detection problem is m-complete in the ∃¹∀⁰ class of Kleene’s analytical hierarchy.