A word w is said to be closed if it has a proper factor x which occurs exactly twice in w, as a
prefix and as a suffix of w. Based on the concept of Ziv–Lempel factorization, we define the …

arXiv:2403.15215v1 [cs.DM] 22 Mar 2024 Page 1 Exploring the Crochemore and Ziv-Lempel
factorizations of some automatic sequences with the software Walnut Marieh Jahannia1[0000−0001−8510−2599] …

In this paper, we propose a nuanced variation in the kernel words of the tribonacci
sequence. Our primary objective is to investigate the intrinsic properties of the kernel words …

Given an infinite word, enumerating its factors is an important exercise for understanding the
structure of the word. The process of finding all the factors is quite tricky for two-dimensional …

The m-Bonacci word is the unique fixed point of the morphism φ m: 0→ 01, 1→ 02, 2→
03,…,(m-2)→ 0 (m-1),(m-1)→ 0. The finite m-Bonacci word wn, m is defined as wn, m= φ mn …

In this paper, we study period-doubling sequences over an ordered alphabet of size q≥ 2.
We present properties of these words relative to the structure of their palindromic factors …

The quasi-Tribonacci sequence T, which is a transformation of the Tribonacci sequence, is
the fixed point of morphism ϕ: 0→ 01, 1→ 12, 2→ 0. In this paper, we study the properties of …

The palindromic Ziv-Lempel factorization of Fibonacci word 1 Introduction Page 1 The
palindromic Ziv-Lempel factorization of Fibonacci word Morteza Mohammad-Noori1 School of …

The Pascal triangle and the corresponding Sierpiński fractal are fairly well-studied
mathematical objects, which both exhibit connections with many different scientific areas …