Periodic D0L languages
The following problem in combinatorial semigroup theory and in formal language theory is proved to be decidable. Given a morphism \(h:A^*\to A^*\) and a word \(w\in A^*\) over the alphabet A, is the sequence w, h(w), \(h^ 2(w)\),... eventually periodic, that is, does there exist integers i, p and \(e>0\) such that \(h^{i+p}(w)=(h^ i(w))^ e\)?
scientific article; zbMATH DE number 4022656
scientific article