Factor Complexity of Infinite Words Associated with Non-Simple Parry Numbers (Q3182865): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 0812.0164 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 14:40, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Factor Complexity of Infinite Words Associated with Non-Simple Parry Numbers |
scientific article |
Statements
Factor Complexity of Infinite Words Associated with Non-Simple Parry Numbers (English)
0 references
16 October 2009
0 references
factor complexity function
0 references
Parry numbers
0 references
