On periodicity and low complexity of infinite permutations (Q2461768): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejc.2007.04.017 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1963909585 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A remark on morphic sturmian words / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4410008 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On permutations containing no long arithmetic progressions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complexity of sequences and dynamical systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On permutations generated by infinite binary words / rank | |||
Normal rank | |||
Latest revision as of 13:19, 27 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On periodicity and low complexity of infinite permutations |
scientific article |
Statements
On periodicity and low complexity of infinite permutations (English)
0 references
21 November 2007
0 references
