The structure of subword graphs and suffix trees of Fibonacci words

DOI10.1016/J.TCS.2006.07.025zbMATH Open1153.68044OpenAlexW2087738656MaRDI QIDQ860864FDOQ860864

Authors: 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

Recommendations

• Implementation and Application of Automata
• A simple representation of subwords of the Fibonacci word
• Arithmetics on suffix arrays of Fibonacci words
• Usefulness of directed acyclic subword graphs in problems related to standard Sturmian words
• scientific article; zbMATH DE number 36117

zbMATH Keywords

suffix treesFibonacci wordssubword graphs

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (17)

• On arithmetically progressed suffix arrays and related Burrows-Wheeler transforms
• The structure of Zeckendorf expansions
• Sturmian graphs and integer representations over numeration systems
• The maximal number of cubic runs in a word
• On the structure of compacted subword graphs of Thue-Morse words and their applications
• The numbers of repeated palindromes in the Fibonacci and Tribonacci words
• Usefulness of directed acyclic subword graphs in problems related to standard Sturmian words
• Repetitions in strings: algorithms and combinatorics
• Composite repetition-aware data structures
• Linear-size suffix tries and linear-size CDAWGs simplified and improved
• A simple representation of subwords of the Fibonacci word
• Involutive Fibonacci words
• Arithmetics on suffix arrays of Fibonacci words
• Computing the number of cubic runs in standard Sturmian words
• The number of runs in a string
• Implementation and Application of Automata
• Sturmian and Episturmian Words

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q860864)