Three-word codes \a,aba,u\ having a finite completion

DOI10.1142/S0129054125500091MaRDI QIDQ6854537zbMATH OpenFDO

Authors Chunhua Cao, Zhongmei Yan, Yali Yang, Hao Xie, Yingheng Li

Publication date 24 February 2026

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054125500091

zbMATH Keywords

finite completionmaximal codeprefix-suffix-indecomposable codethree-word code

Mathematics Subject Classification ID

Semigroups in automata theory, linguistics, etc. (20M35) Algebraic theory of languages and automata (68Q70) Prefix, length-variable, comma-free codes (94A45)

Cites work

• A three-word code which is not prefix-suffix composed
• Codes and automata.
• Completing circular codes in regular submonoids
• Completing codes
• Completing comma-free codes
• Completing prefix codes in submonoids.
• Completing solid codes to maximal comma-free codes
• Completion of codes with finite bi-decoding delays.
• Completion of recognizable bifix codes
• Each regular code is included in a maximal regular code
• Embedding a -invariant code into a complete one
• Embedding rationally independent languages into maximal ones
• FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS
• scientific article; zbMATH DE number 2143015 (Why is no real title available?)
• Machines, Computations, and Universality
• On codes having no finite completion
• On codes having no finite completions
• On codes with a finite deciphering delay: Constructing uncompletable words
• Topologies for error-detecting variable-length codes
• Variable-length codes independent or closed with respect to edit relations

This page was built for publication: Three-word codes \(\{a,aba,u\}\) having a finite completion

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