Email this article On Alphabetic Coding for Superwords
- Authors: Marchenkov S.S.1
-
Affiliations:
- Faculty of Computational Mathematics and Cybernetics
- Issue: Vol 55, No 3 (2019)
- Pages: 275-282
- Section: Coding Theory
- URL: https://journal-vniispk.ru/0032-9460/article/view/166620
- DOI: https://doi.org/10.1134/S0032946019030062
- ID: 166620
Cite item
Open Access
Access granted
Subscription Access
Abstract
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 ∃1∀0 class of Kleene’s analytical hierarchy.
About the authors
S. S. Marchenkov
Faculty of Computational Mathematics and Cybernetics
Author for correspondence.
Email: ssmarchen@yandex.ru
Russian Federation, Moscow
Supplementary files
