Shuffle Relations and Codes

DOI10.1080/02522667.1991.10699083MaRDI QIDQ4009159zbMATH OpenOpenAlexFDO

Authors Gabriel Thierrin, Shyr-Shen Yu

Publication date 27 September 1992

Published in Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02522667.1991.10699083

zbMATH Keywords

\(n\)-shuffle codes\(n\)-shuffle relationsantichainsbinary relationsembedding orderinfix orderprefix codessubmonoidssyntactic monoidstransitive closure

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45) Other types of codes (94B60)

Recommendations

• Relations on free monoids, their independent sets, and codes¹
• Infinite hierarchy of shuffle expressions over a finite alphabet
• Anti-commutative languages and n-codes
• Theoretical Aspects of Computing – ICTAC 2005
• On codes defined by binary relations. I: Embedding problem

Cites work

• Homomorphisms and subdirect decompositions of semigroups
• scientific article; zbMATH DE number 3566726 (Why is no real title available?)
• Hypercodes
• The syntactic monoid of a hypercode

Cited in

(4)

• Relations on free monoids, their independent sets, and codes¹
• k-p-infix codes and semaphore codes
• Post-plus languages
• On (left) partial shuffle

This page was built for publication: Shuffle Relations and Codes

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