Structure of 3-infix-outfix maximal codes.

DOI10.1016/S0304-3975(97)00097-2MaRDI QIDQ1389661zbMATH OpenOpenAlexFDO

Authors Dong-Yang Long, Jian Ma, Duanning Zhou

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)

Recommendations

• On the structure of some group codes
• Finite maximal infix codes
• On maximality for some kinds of codes over two-letter alphabets
• scientific article; zbMATH DE number 4189637

Cites work

• scientific article; zbMATH DE number 50943 (Why is no real title available?)
• scientific article; zbMATH DE number 1988973 (Why is no real title available?)
• scientific article; zbMATH DE number 2196222 (Why is no real title available?)
• n-Prefix–suffix languages^∗
• Anti-commutative languages and n-codes
• Languages whose \(n\)-element subsets are codes
• On group codes
• On the structure of some group codes
• Outfix and infix codes and related classes of languages

Cited in

(6)

• 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
• Finite maximal infix codes
• Maximal bifix codes of degree 3
• \(k\)-p-infix codes and semaphore codes

This page was built for publication: Structure of 3-infix-outfix maximal codes.

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