The combinatorial properties of Fibonacci words and arrays are now a popularly studied
concept in formal language theory. One such property is the palindromic property of words …

Combinatorial properties of Fibonacci words and Fibonacci arrays play a vital role in formal
languages. The origination of partial words came through the behaviour of DNA strands. In …

If x is a non-empty string then the repetition xx is called a tandem repeat. Similarly, a tandem
in a two-dimensional array X is a configuration consisting of copies of a same primitive block …

Various scholars have investigated Fibonacci arrays to uncover its combinatorial features
and applications. As an extension of Involutive Fibonacci words, Involutive Fibonacci arrays …

In this paper, we put forward models that generate two-dimensional palindromic languages
with array-rewriting rules. The rewriting rules are of either regular or context-free type with …

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 …

If $ x $ is a non-empty string then the repetition $ xx $ is called a tandem repeat. Similarly, a
tandem in a two dimensional array $ X $ is a configuration consisting of a same primitive …

A two-dimensional (2D) word is a 2D palindrome if it is equal to its reverse and it is an HV-
palindrome if all its columns and rows are 1D palindromes. We characterize such words and …

We bring into attention the interplay between model theory of committed graphs (1-regular
graphs) and their palindromic characteristic in the domain of formal languages. We prove …

This paper extends the problem of 2-dimensional palindrome search into the area of
approximate matching. Using the Hamming distance as the measure, we search for 2D …