Structure of 3-infix-outfix maximal codes.

DOI10.1016/S0304-3975(97)00097-2zbMath1053.68577OpenAlexW2022610479MaRDI QIDQ1389661

Duanning Zhou, Dong Yang Long, Jian Ma

Publication date: 30 June 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00097-2

zbMATH Keywords

Group codesn-infix--outfixn-prefix-suffixUniform codes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05)

Related Items

INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES ⋮ Codes defined by multiple sets of trajectories ⋮ \(n\)-PS-codes, 2-infix-outfix codes and some related classes of codes ⋮ \(k\)-p-infix codes and semaphore codes

Cites Work

• On group codes
• Languages whose \(n\)-element subsets are codes
• Outfix and infix codes and related classes of languages
• On the structure of some group codes
• Anti-commutative languages and n-codes
• n-Prefix–suffix languages^∗
• Unnamed Item
• Unnamed Item
• Unnamed Item