The structure of subword graphs and suffix trees of Fibonacci words

DOI10.1016/J.TCS.2006.07.025zbMath1153.68044OpenAlexW2087738656MaRDI QIDQ860864

Wojciech Rytter

Publication date: 9 January 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.07.025

zbMATH Keywords

Fibonacci wordssuffix treessubword graphs

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (15)

Arithmetics on Suffix Arrays of Fibonacci Words ⋮ The number of runs in a string ⋮ The numbers of repeated palindromes in the Fibonacci and Tribonacci words ⋮ A simple representation of subwords of the Fibonacci word ⋮ Composite Repetition-Aware Data Structures ⋮ Sturmian graphs and integer representations over numeration systems ⋮ On the structure of compacted subword graphs of Thue-Morse words and their applications ⋮ Sturmian and Episturmian Words ⋮ Computing the number of cubic runs in standard Sturmian words ⋮ Unnamed Item ⋮ The maximal number of cubic runs in a word ⋮ Minimal forbidden factors of circular words ⋮ The structure of Zeckendorf expansions ⋮ Repetitions in strings: algorithms and combinatorics ⋮ USEFULNESS OF DIRECTED ACYCLIC SUBWORD GRAPHS IN PROBLEMS RELATED TO STANDARD STURMIAN WORDS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A combinatorial property of the Fibonacci words
• A characterization of the squares in a Fibonacci string
• On cube-free \(\omega\)-words generated by binary morphisms
• Repetitions in the Fibonacci infinite word
• Two-way string-matching
• A remark on morphic sturmian words
• Jewels of Stringology
• Density of Critical Factorizations
• The Number of Runs in a String: Improved Analysis of the Linear Upper Bound
• Developments in Language Theory

This page was built for publication: The structure of subword graphs and suffix trees of Fibonacci words