Pages that link to "Item:Q860864"
From MaRDI portal
The following pages link to The structure of subword graphs and suffix trees of Fibonacci words (Q860864):
Displaying 12 items.
- Sturmian graphs and integer representations over numeration systems (Q412361) (← links)
- On the structure of compacted subword graphs of Thue-Morse words and their applications (Q414440) (← links)
- Computing the number of cubic runs in standard Sturmian words (Q496558) (← links)
- Repetitions in strings: algorithms and combinatorics (Q1034529) (← links)
- A simple representation of subwords of the Fibonacci word (Q1675765) (← links)
- The maximal number of cubic runs in a word (Q1757839) (← links)
- The number of runs in a string (Q2381507) (← links)
- The numbers of repeated palindromes in the Fibonacci and Tribonacci words (Q2399293) (← links)
- Composite Repetition-Aware Data Structures (Q2942243) (← links)
- Arithmetics on Suffix Arrays of Fibonacci Words (Q3449364) (← links)
- Sturmian and Episturmian Words (Q3522857) (← links)
- USEFULNESS OF DIRECTED ACYCLIC SUBWORD GRAPHS IN PROBLEMS RELATED TO STANDARD STURMIAN WORDS (Q3655533) (← links)
