On group codes

DOI10.1016/0304-3975(95)00238-3zbMath0874.68172OpenAlexW2045311598MaRDI QIDQ671367

Dong Yang Long

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00238-3

zbMATH Keywords

group codessyntactic monoid

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35) Prefix, length-variable, comma-free codes (94A45)

Related Items

Structure of 3-infix-outfix maximal codes. ⋮ Combinatorial properties of codes with degree \(n\) ⋮ \(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

• Rational strong codes and structure of rational group languages
• Outfix and infix codes and related classes of languages
• On the structure of some group codes
• Reflective star languages and codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item