Sets of primitive words given by fixed points of mappings

Abstract

We present a solution of some equations on primitive words and in this sense our paper is a continuation of a research of T. Harju and M. Linna [3]. Our construction is less complicated and more general than in [3]. All the solutions are effective.

Keywords:

• Word
• Primitive Word
• Free Monoid
• Fixed Point
• Mapping

C.R. Categories:

• F.4.2: Parallel rewriting systems
• F.4.3: Decision problem
• G.2.1: Combinatorial algorthims