Some combinatorial properties of solid codes

DOI10.1007/s13226-021-00093-wzbMath1505.94060OpenAlexW3172060057MaRDI QIDQ2065362

Haiyan Liu, Y. Q. Guo, Kar Ping Shum

Publication date: 7 January 2022

Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13226-021-00093-w

zbMATH Keywords

solid codevariable-length codeinfix codedecomposition of solid code

Mathematics Subject Classification ID

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

Related Items (1)

\(n\)-PS-codes, 2-infix-outfix codes and some related classes of codes

Cites Work

• On some decompositions of r-disjunctive languages
• Solid codes and disjunctive domains
• f-disjunctive congruences and a generalization of monoids with length
• Outfix and infix codes and related classes of languages
• \(d\)-minimal languages
• Some results in \(r\)-disjunctive languages and related topics
• Solid codes and the uniform density of fd-domains.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some combinatorial properties of solid codes