Super-stationary set, subword problem and the complexity (Q1043967): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) 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 / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2009.02.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2106784380 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Uniform sets and complexity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Language structure of pattern Sturmian words / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sequence entropy and the maximal pattern complexity of infinite words / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximal pattern complexity for discrete systems / rank | |||
Normal rank | |||
Latest revision as of 07:24, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Super-stationary set, subword problem and the complexity |
scientific article |
Statements
Super-stationary set, subword problem and the complexity (English)
0 references
10 December 2009
0 references
uniform set
0 references
super-stationary set
0 references
complexity
0 references
super-subword
0 references
