Fibonacci pictures on a binary alphabet

DOI10.1007/978-3-031-97100-6_1MaRDI QIDQ6884671zbMATH OpenFDO

Authors Marcella Anselmo, Dora Giammarresi, Maria Madonia, C. Selmi

Publication date 15 December 2025

Full work available at URL https://doi.org/10.1007/978-3-031-97100-6_1

zbMATH Keywords

Fibonacci wordspicturesrepetitionstwo-dimensional arrays

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Bad pictures: some structural properties related to overlaps
• Balance properties of multi-dimensional words
• Classification of string languages via tiling recognizable picture languages
• Context-sensitive string languages and recognizable picture languages
• Double sequences of low complexity
• Exact and inexact search for 2d side-sharing tandems
• Extracting powers and periods in a word from its runs structure
• Fibonacci arrays and their two-dimensional repetitions
• scientific article; zbMATH DE number 3947643 (Why is no real title available?)
• scientific article; zbMATH DE number 1024080 (Why is no real title available?)
• scientific article; zbMATH DE number 1390079 (Why is no real title available?)
• scientific article; zbMATH DE number 7770057 (Why is no real title available?)
• Locating factors of the infinite Fibonacci word
• Palindromes and two-dimensional Sturmian sequences
• Repetitions in the Fibonacci infinite word
• The maximal number of cubic runs in a word
• Two-dimensional Fibonacci words: tandem repeats and factor complexity

This page was built for publication: Fibonacci pictures on a binary alphabet

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