Languages whose \(n\)-element subsets are codes

DOI10.1016/0304-3975(92)90341-CzbMath0747.68035MaRDI QIDQ1184989

H. J. Shyr, Helmut Jürgensen, Gabriel Thierrin, Masami Ito

Publication date: 28 June 1992

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

zbMATH Keywords

\(n\)-codes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45)

Related Items (4)

Transducers and the decidability of independence in free monoids ⋮ Structure of 3-infix-outfix maximal codes. ⋮ \(k\)-p-infix codes and semaphore codes ⋮ Product of Finite Maximal P-Codes. This paper was supported in part by HK UGC grants 9040596, 9040511 and City U Strategic Grants 7001189, 7001060, and by the Natural Science Foundation of China (project No. 60073056) and the Guangdong Provincial Natural Science Foundation (project No. 001174)

Cites Work

• Outfix and infix codes and related classes of languages
• Anti-commutative languages and n-codes
• Relations on free monoids, their independent sets, and codes¹
• n-Prefix–suffix languages^∗
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Languages whose \(n\)-element subsets are codes