On three-element codes

DOI10.1016/0304-3975(85)90155-0zbMath0574.68062OpenAlexW1975641934MaRDI QIDQ1063421

Juhani Karhumäki

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90155-0

zbMATH Keywords

prefix codeinjective morphisms of free semigroups

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Prefix, length-variable, comma-free codes (94A45)

Related Items (10)

Many aspects of defect theorems ⋮ On codes, \(\omega\)-codes and \(\omega\)-generators ⋮ A first step in characterizing three-element codes ⋮ A defect property of codes with unbounded delays ⋮ Finitary codes for biinfinite words ⋮ On the proportion of prefix codes in the set of three-element codes ⋮ The second step in characterizing a three-word code ⋮ The intersection of \(3\)-maximal submonoids ⋮ Cumulative defect. ⋮ Multiple factorizations of words and defect effect

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Synchronization and simplification
• The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids
• A property of three-element codes
• Codes with bounded synchronization delay

This page was built for publication: On three-element codes