On alphabetic coding for superwords

DOI10.1134/S0032946019030062MaRDI QIDQ2190904zbMATH OpenWikidataFDO

Authors S. S. Marchenkov

Publication date 23 June 2020

Published in Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0032946019030062

zbMATH Keywords

alphabetic codingKleene's analytical hierarchysuperword

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Word problems, etc. in computability and recursion theory (03D40) Other types of codes (94B60)

Recommendations

• On maximality for some kinds of codes over two-letter alphabets
• On codes defined by binary relations. II: Characterizations and maximality
• scientific article; zbMATH DE number 8007
• scientific article; zbMATH DE number 3930882
• Algorithmic ways of deciding whether an infinite language is a code

Cites work

• Definability in the language of functional equations of a countable-valued logic
• scientific article; zbMATH DE number 3158348 (Why is no real title available?)
• scientific article; zbMATH DE number 3847301 (Why is no real title available?)
• scientific article; zbMATH DE number 3262112 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• On the complexity of solutions of systems of functional equations in countable-valued logic

Cited in

(1)

• An embedding algorithm for supercodes and sucypercodes

This page was built for publication: On alphabetic coding for superwords

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2190904)