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

DOI10.1007/s00236-023-00449-1MaRDI QIDQ6150116

Haiyan Liu, Tianjie Zhang, Rongdong Cui

Publication date: 5 March 2024

Published in: Acta Informatica (Search for Journal in Brave)

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35) Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Structure of 3-infix-outfix maximal codes.
• Anti-commutative languages and n-codes
• Some combinatorial properties of solid codes
• On \(k\)-comma codes
• Some results on \((k, m)\)-comma codes
• Relations on free monoids, their independent sets, and codes¹
• n-Prefix–suffix languages^∗
• \(k\)-p-infix codes and semaphore codes
• Characterizations of \(k\)-comma codes and \(k\)-comma intercodes