A simple representation of subwords of the Fibonacci word

DOI10.1016/j.ipl.2010.08.006zbMath1379.68267OpenAlexW2020383307MaRDI QIDQ1675765

Bartosz Walczak

Publication date: 3 November 2017

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.08.006

zbMATH Keywords

algorithmscombinatorial problemsFibonacci word

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Related Items (2)

Combinatorial properties of Fibonacci partial words and arrays ⋮ A class of generalized Tribonacci sequences applied to counting problems

Cites Work

• Unnamed Item
• Locating factors of the infinite Fibonacci word
• The structure of subword graphs and suffix trees of Fibonacci words
• A representation theorem of the suffixes of characteristic sequences
• Compressed string-matching in standard Sturmian words

This page was built for publication: A simple representation of subwords of the Fibonacci word