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

DOI10.1007/S00236-023-00449-1MaRDI QIDQ6150116FDO

Authors Haiyan Liu, Rongdong Cui, Tianjie Zhang

Publication date 5 March 2024

Published in Acta Informatica (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• n-Prefix–suffix languages^∗
• Anti-commutative languages and n-codes
• Characterizations of \(k\)-comma codes and \(k\)-comma intercodes
• Codes and automata.
• On \(k\)-comma codes
• Relations on free monoids, their independent sets, and codes¹
• Some combinatorial properties of solid codes
• Some results on \((k, m)\)-comma codes
• Structure of 3-infix-outfix maximal codes.
• \(k\)-p-infix codes and semaphore codes

This page was built for publication: \(n\)-PS-codes, 2-infix-outfix codes and some related classes of codes

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