Decidability of periodicity for infinite words (Q4727446): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The ω sequence problem for DOL systems is decidable / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On infinite words obtained by iterating morphisms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3332269 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3332270 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4746787 / rank | |||
Normal rank | |||
Latest revision as of 18:41, 17 June 2024
scientific article; zbMATH DE number 4001500
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decidability of periodicity for infinite words |
scientific article; zbMATH DE number 4001500 |
Statements
Decidability of periodicity for infinite words (English)
0 references
1986
0 references
free monoids
0 references
elementary morphisms
0 references
infinite word
0 references
iterated morphism
0 references
