Some results on digital segments and balanced words
From MaRDI portal
Publication:6639744
DOI10.1016/J.TCS.2024.114935MaRDI QIDQ6639744FDOQ6639744
Authors: Alessandro De Luca, Gabriele Fici
Publication date: 18 November 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Certain words on the real projective line
- Sturmian words: structure, combinatorics, and their arithmetics
- Sturmian words, Lyndon words and trees
- Digital straightness -- a review
- ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
- Formal Languages, Automata and Numeration Systems 1
- Enumeration and structure of trapezoidal words
- Characterisations of balanced words via orderings
- Sturmian and Episturmian Words
- Some combinatorial properties of Sturmian words
- On the number of factors of Sturmian words
- Symbolic Dynamics II. Sturmian Trajectories
- On an involution of Christoffel words and Sturmian morphisms
- Some characterizations of finite Sturmian words.
- Title not available (Why is that?)
- On Christoffel classes
- Title not available (Why is that?)
- A combinatorial problem on trapezoidal words.
- Minimal non-convex words
- On the Number of Balanced Words of Given Length and Height over a Two-Letter Alphabet
- On some combinatorial problems in free monoids
- Studies on finite Sturmian words
- On the structure of bispecial Sturmian words
- Title not available (Why is that?)
- Symbolic dynamics.
This page was built for publication: Some results on digital segments and balanced words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6639744)