Shuffle Relations and Codes

DOI10.1080/02522667.1991.10699083zbMath0749.94023OpenAlexW2059798035MaRDI QIDQ4009159

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

antichainstransitive closureprefix codesbinary relationssubmonoidssyntactic monoidsinfix orderembedding order\(n\)-shuffle codes\(n\)-shuffle relations

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

• Homomorphisms and subdirect decompositions of semigroups
• The syntactic monoid of a hypercode
• Hypercodes
• Unnamed Item