A simple representation of subwords of the Fibonacci word

DOI10.1016/J.IPL.2010.08.006zbMATH Open1379.68267OpenAlexW2020383307MaRDI QIDQ1675765FDOQ1675765

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

Recommendations

• Implementation and Application of Automata
• The structure of subword graphs and suffix trees of Fibonacci words
• scientific article; zbMATH DE number 4183705
• Factorizations of the Fibonacci infinite word
• scientific article; zbMATH DE number 895316

zbMATH Keywords

algorithmscombinatorial problemsFibonacci word

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A representation theorem of the suffixes of characteristic sequences
• The structure of subword graphs and suffix trees of Fibonacci words
• Locating factors of the infinite Fibonacci word
• Compressed string-matching in standard Sturmian words

Cited In (10)

• A class of generalized Tribonacci sequences applied to counting problems
• The structure of subword graphs and suffix trees of Fibonacci words
• Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism
• Title not available (Why is that?)
• Title not available (Why is that?)
• SOFSEM 2006: Theory and Practice of Computer Science
• Combinatorial properties of Fibonacci partial words and arrays
• Arithmetics on suffix arrays of Fibonacci words
• Implementation and Application of Automata
• The \(D\)-representation of nonnegative integers and the Fibonacci factorization of suffixes of infinite Fibonacci words

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

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