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.

中文翻译：

---

关于超级词的字母编码

我们考虑超字的字母编码。我们为有限和无限代码的情况建立了明确的编码标准。我们证明，在无限码的情况下的模糊性检测问题是米-complete在∃ ¹ ∀ ⁰类的Kleene的层次分析的。