Palindromes in involutive Fibonacci arrays

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 and arrays. In this paper, we construct algorithms to generate the involutive Fibonacci words and involutive Fibonacci arrays and to check, if a given word is involutive Fibonacci or not. We verify the algorithms using python programming. And we investigate the number of palindromes present in the sequences of involutive Fibonacci words and involutive Fibonacci arrays which has various applications.