The second step in characterizing a three-word code

DOI10.1007/s00236-023-00444-6OpenAlexW4386544131MaRDI QIDQ6090990

Chunhua Cao, Jiao Xu, Di Yang, Qian Du, Lei Liao, Guichuan Jia

Publication date: 21 November 2023

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-023-00444-6

Mathematics Subject Classification ID

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

Cites Work

• A three-word code which is not prefix-suffix composed
• Three-element codes with one \(d\)-primitive word
• On three-element codes
• A property of three-element codes
• \(d\)-words and \(d\)-languages
• On the independence of equations in three variables.
• A first step in characterizing three-element codes
• On F-semigroups with three generators
• Conway's problem for three-word sets.
• Completing codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The second step in characterizing a three-word code