Periodic D0L languages (Q1093376)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4022656
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Periodic D0L languages |
scientific article; zbMATH DE number 4022656 |
Statements
Periodic D0L languages (English)
0 references
1986
0 references
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\)?
0 references
free semigroups
0 references
D0L-systems
0 references
periodicity of words
0 references
formal language
0 references
0.8485743999481201
0 references
0.8213232159614563
0 references
0.8169223666191101
0 references
0.8166100382804871
0 references
