1-2hit |
In this paper, we give some resuts on primitive words, square-free words and disjunctive languages. We show that for a word u ∈Σ+, every element of λ(cp(u)) is d-primitive iff it is square-free, where cp(u) is the set of all cyclic-permutations of u, and λ(cp(u)) is the set of all primitive roots of it. Next we show that pmqn is a primitive word for every n, m ≥1 and primitive words p, q, under the condition that |p| = |q| and (m, n) ≠ (1, 1). We also give a condition of disjunctiveness for a language.
In this paper, we introduce a syntactically embedded (s-embedded) language, and consider its principal congruence. The following three results are proved, where PL is the principal congruence of a language L, and W(L) is the residual of L. (1) For a language K, s-embedded in M, K is equal to a PM class. (2) For a language K, s-embedded in an infix language M, K is equal to a PW(M) class. (3) For a nonempty s-embedded language L, if L is double-unitary, then L is equal to a PW(M) class. From the above results, we can obtain those for principal congruence of some codes. For example, Ln is equal to a PLn+1 class for an inter code L of index n.