On the structure of bispecial Sturmian words
From MaRDI portal
Publication:2637643
DOI10.1016/j.jcss.2013.11.001zbMath1285.68132arXiv1311.4904OpenAlexW2056235565MaRDI QIDQ2637643
Publication date: 13 February 2014
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1311.4904
Related Items
The sequence of open and closed prefixes of a Sturmian word, Minimal complexity of equidistributed infinite permutations, Extremal values of semi‐regular continuants and codings of interval exchange transformations, Sturmian numeration systems and decompositions to palindromes, Studies on finite Sturmian words
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using minimal absent words to build phylogeny
- Special factors and the combinatorics of suffix and factor automata
- On the number of factors of Sturmian words
- Burrows-Wheeler transform and Sturmian words
- Some combinatorial properties of Sturmian words
- Sturmian words: structure, combinatorics, and their arithmetics
- Sturmian words, Lyndon words and trees
- Partitioning the positive integers to seven Beatty sequences
- Forbidden words in symbolic dynamics
- Words and forbidden factors
- Balanced words
- Enumeration and structure of trapezoidal words
- A characterization of balanced episturmian sequences
- Complementing and exactly covering sequences
- Uniformly balanced words with linear complexity and prescribed letter frequencies
- A Characterization of Bispecial Sturmian Words
- An Arithmetic and Combinatorial Approach to Three-Dimensional Discrete Lines
- Balanced sequences and optimal routing
- Complexity of sequences defined by billiard in the cube
- Minimal forbidden words and symbolic dynamics
- Episturmian words: a survey
- Suffix Automata and Standard Sturmian Words
- Developments in Language Theory
