Two-dimensional Fibonacci words: tandem repeats and factor complexity
From MaRDI portal
Publication:6107832
DOI10.1016/j.aam.2023.102553zbMath1529.68243arXiv2204.13977OpenAlexW4376126374MaRDI QIDQ6107832
No author found.
Publication date: 3 July 2023
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.13977
Fibonacci wordstandemsFibonacci arraystwo-dimensional factor complexitytwo-dimensional morphic words
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Periodicity in rectangular arrays
- Two-dimensional iterated morphisms and discrete planes
- Locating factors of the infinite Fibonacci word
- Multidimensional generalized automatic sequences and shape-symmetric morphic words
- Repetitions in strings: algorithms and combinatorics
- The exact number of squares in Fibonacci words
- Fibonacci arrays and their two-dimensional repetitions
- Properties of Fibonacci languages
- Linear time algorithms for finding and representing all the tandem repeats in a string
- Multidimensional period recovery
- Two-dimensional maximal repetitions
- Combinatorial properties of Fibonacci arrays
- Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties
- Automatic Sequences
- Capacity and Expressiveness of Genomic Tandem Duplication
- PREFIX PICTURE CODES: A DECIDABLE CLASS OF TWO-DIMENSIONAL CODES
- Numeration systems on a regular language
- Two-dimensional Fibonacci words: tandem repeats and factor complexity
