Combinatorics on Words
From MaRDI portal
Publication:3549476
Recommendations
Cited in
(77)- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- On arithmetically progressed suffix arrays and related Burrows-Wheeler transforms
- Book review of: Martin Aigner, Markov's theorem and 100 years of the uniqueness conjecture.
- Mini-workshop: Combinatorics on words. Abstracts from the mini-workshop held August 22nd -- August 28th, 2010.
- Discrete segments of \(\mathbb{Z}^3\) constructed by synchronization of words
- Variety and multiplicity for partitioned factors in Christoffel and Sturmian words
- Multiplicative analogue of Markoff-Lagrange spectrum and Pisot numbers
- An extension of Christoffel duality to a subset of Sturm numbers and their characteristic words
- Minimal non-convex words
- On the fixed points of the iterated pseudopalindromic closure operator
- Repetitions in words
- The \(q\)-analog of the Markoff injectivity conjecture over the language of a balanced sequence
- On the structure of compacted subword graphs of Thue-Morse words and their applications
- On a theorem of A. A. Markoff
- Lyndon + Christoffel = digitally convex
- Second basic theorem of Hurwitz
- On a generalization of Christoffel words: epichristoffel words
- Balance properties of Arnoux-Rauzy words
- A combinatorial formula for rank 2 cluster variables
- Maximal supports and Schur-positivity among connected skew shapes
- The critical exponent functions
- Extended suffix array construction using Lyndon factors
- An explicit counterexample to the Lagarias-Wang finiteness conjecture
- scientific article; zbMATH DE number 7559170 (Why is no real title available?)
- The continuous weak order
- On factorially balanced sets of words
- A separation between RLSLPs and LZ77
- Music and combinatorics on words: a historical survey
- An Inequality for the Number of Periods in a Word
- Properties of SAT formulas characterizing convex sets with given projections
- A characterization of binary morphisms generating Lyndon infinite words
- Perfectly clustering words are primitive positive elements of the free group
- On the Lévy constants of Sturmian continued fractions
- On the Step-Patterns of Generated Scales that are Not Well-Formed
- Cyclic Complexity of Words
- The Characterization of Rational Numbers Belonging to a Minimal Path in the Stern-Brocot Tree According to a Second Order Balancedness
- Markov word patterns and a relation on -words
- Second Order Balance Property on Christoffel Words
- Partitioned factors in Christoffel and Sturmian words
- A characterization of Sturmian sequences by indistinguishable asymptotic pairs
- Convexity preserving deformations of digital sets: characterization of removable and insertable pixels
- Optimal policies for observing time series and related restless bandit problems
- The origins of combinatorics on words
- Bowditch's Q-conditions and Minsky's primitive stability
- Christoffel and Fibonacci tiles
- Standard factors of Sturmian words
- Sturmian words and Cantor sets arising from unique expansions over ternary alphabets
- A \(d\)-dimensional extension of Christoffel words
- Intrinsic Diophantine approximation on the unit circle and its Lagrange spectrum
- On periodic properties of circular words
- Automorphic orbits in free groups: words versus subgroups.
- On the Markov numbers: fixed numerator, denominator, and sum conjectures
- A two-dimensional singular function via Sturmian words in base \(\beta\)
- Naming and ordering the modes, in light of combinatorics on words
- Sturmian words and the Stern sequence
- Two linear-time algorithms for computing the minimum length polygon of a digital contour
- Abelian repetitions in Sturmian words
- Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm
- Topological invariants for words of linear factor complexity
- Perfect balance and circularly rich words
- Lattice paths and the Prouhet-Thue-Morse sequence
- Studies on finite Sturmian words
- Computing the number of cubic runs in standard Sturmian words
- Christoffel Words and Markoff Triples: An Algebraic Approach
- Renormalization, thermodynamic formalism and quasi-crystals in subshifts
- Two infinite families of polyominoes that tile the plane by translation in two distinct ways
- Trees and languages with periodic signature
- Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
- Continued fractions with \(\mathrm{SL}(2, \mathbb{Z})\)-branches: combinatorics and entropy
- Regions and standard modes
- Alexander Duality and Rational Associahedra
- Dynamic minimum length polygon
- Markov spectra for modular billiards
- Snake graphs and 70
- A \(q\)-analog of the Markoff injectivity conjecture holds
- A function containing all Lagrange numbers less than three
- Words in linear groups, random walks, automata and P-recursiveness
This page was built for publication: Combinatorics on Words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549476)
