On Christoffel classes
From MaRDI portal
Publication:3374754
Recommendations
- Study of Christoffel classes: normal form and periodicity
- scientific article; zbMATH DE number 25391
- Partitioned factors in Christoffel and Sturmian words
- On a class of Lyndon words extending Christoffel words and related to a multidimensional continued fraction algorithm
- Studies on finite Sturmian words
Cites work
- scientific article; zbMATH DE number 1577999 (Why is no real title available?)
- scientific article; zbMATH DE number 2072644 (Why is no real title available?)
- A new characteristic property of the palindrome prefixes of a standard Sturmian word
- Automatic Sequences
- Burrows-Wheeler transform and Sturmian words
- Certain words on the real projective line
- Factors of characteristic words of irrational numbers
- Markoff forms and primitive words
- Moments of conjugacy classes of binary words
- Some combinatorial properties of Sturmian words
- Sturmian words, Lyndon words and trees
- Sturmian words: structure, combinatorics, and their arithmetics
- \(\alpha\)-words and factors of characteristic sequences
Cited in
(37)- A combinatorial view on string attractors
- On an involution of Christoffel words and Sturmian morphisms
- On the Frobenius conjecture
- On Extremal Cases of Hopcroft’s Algorithm
- Studies on finite Sturmian words
- BALANCE PROPERTIES AND DISTRIBUTION OF SQUARES IN CIRCULAR WORDS
- Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm
- Standard Sturmian words and automata minimization algorithms
- Reversible Christoffel factorizations
- Variety and multiplicity for partitioned factors in Christoffel and Sturmian words
- On arithmetically progressed suffix arrays and related Burrows-Wheeler transforms
- A note on Sturmian words
- Novel results on the number of runs of the Burrows-Wheeler-transform
- On the number of equal-letter runs of the bijective Burrows-Wheeler transform
- A characterization of Sturmian sequences by indistinguishable asymptotic pairs
- Hopcroft’s Algorithm and Cyclic Automata
- On the superimposition of Christoffel words
- Hopcroft's algorithm and tree-like automata
- On a generalization of Christoffel words: epichristoffel words
- Balance properties of Arnoux-Rauzy words
- Two infinite families of polyominoes that tile the plane by translation in two distinct ways
- Circular Sturmian words and Hopcroft's algorithm
- On a group theoretic generalization of the Morse-Hedlund theorem
- On extremal cases of Hopcroft's algorithm
- A \(d\)-dimensional extension of Christoffel words
- Christoffel and Fibonacci tiles
- On Christoffel and standard words and their derivatives
- Cyclic Complexity of Words
- Lissajous 3-braids
- Study of Christoffel classes: normal form and periodicity
- Some results on digital segments and balanced words
- Balance Properties and Distribution of Squares in Circular Words
- Partitioned factors in Christoffel and Sturmian words
- Cyclic complexity of words
- The \(q\)-analog of the Markoff injectivity conjecture over the language of a balanced sequence
- On a class of Lyndon words extending Christoffel words and related to a multidimensional continued fraction algorithm
- Bit catastrophes for the Burrows-Wheeler transform
This page was built for publication: On Christoffel classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3374754)
