A hierarchy for circular codes
From MaRDI portal
Recommendations
Cites work
- A combinatorial property of the Fibonacci words
- Fast Pattern Matching in Strings
- Fibonacci numbers and words
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 3943051 (Why is no real title available?)
- scientific article; zbMATH DE number 1389472 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- Infinite words and biprefix codes
- On cube-free \(\omega\)-words generated by binary morphisms
- On some factorizations of infinite words by elements of codes
- Palindromes in the Fibonacci word
- RECENT RESULTS ON EXTENSIONS OF STURMIAN WORDS
- Repetitions in the Fibonacci infinite word
- Some algebraic remarks on circular codes
- Sturmian words: structure, combinatorics, and their arithmetics
- Varieties of comma-free codes
Cited in
(10)- A permuted set of a trinucleotide circular code coding the 20 amino acids in variant nuclear codes
- The relation between \(k\)-circularity and circularity of codes
- Graded alphabets, circular codes, free Lie algebras and comma-free codes
- Circular words and applications
- Maximal dinucleotide and trinucleotide circular codes
- Dinucleotide circular codes
- A classification of 20-trinucleotide circular codes
- Maximal circular codesversusmaximal codes
- Strong trinucleotide circular codes
- A relation between trinucleotide comma-free codes and trinucleotide circular codes
This page was built for publication: A hierarchy for circular codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3537493)
