Exploring iterated morphisms on words: Analysis using subwords and Parikh matrices

Abstract

This paper delves into the investigation of iterated morphisms on words, employing the notions of subwords and Parikh matrices for examination. In the field of formal language theory, properties of finite words establish an interesting topic of investigation. The Parikh matrix plays a vital role in the study of words through algebraic arithmetic. Recently, different morphisms on words have been studied, and their properties are analyzed. In this paper, we consider iterated morphisms on words by using the concept of subwords and Parikh matrices. We explore the behavior of iterated morphisms applied to words and investigate how these transformations affect the structure and properties of the resulting words. By utilizing Parikh matrices, we analyze the arithmetic properties of iterated morphisms and examine their impact on word complexity and structure.