Euclidean strings
From MaRDI portal
Publication:1399993
DOI10.1016/S0304-3975(02)00589-3zbMATH Open1028.68107OpenAlexW2914993520MaRDI QIDQ1399993FDOQ1399993
Publication date: 30 July 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00589-3
Lyndon wordEuclidean algorithmmorphismStern-Brocot treeSturmian sequenceChristoffel wordBeatty sequenceFibonacci stringrational mechanical sequence
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sturmian words, Lyndon words and trees
- Palindromes in the Fibonacci word
- Some combinatorial properties of Sturmian words
- A characterization of the squares in a Fibonacci string
- The Bracket Function and Complementary Sets of Integers
- Recounting the Rationals
- The exact number of squares in Fibonacci words
- The number of irreducible polynomials and Lyndon words with given trace
- Complexity of generalized Rudin-Shapiro sequences
- Many to One Embeddings from Grids into Cylinders, Tori, and Hypercubes
- Some properties of the singular words of the Fibonacci word
Cited In (2)
Recommendations
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Lattices and strings π π
- Geometry of the string equations π π
- Shape of elastic strings in Euclidean space π π
- Generalized Euclidean Bosonic String Equations π π
- Generalized Gauss map and geometry of strings π π
- Dirichlet strings π π
- Geometric aspects of confining strings π π
This page was built for publication: Euclidean strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1399993)