Uniform sets and super-stationary sets over general alphabets (Q3093791): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Super-stationary set, subword problem and the complexity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Uniform sets and complexity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximal pattern complexity of words over \(\ell\) letters / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximal pattern complexity of two-dimensional words / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximal pattern complexity for Toeplitz words / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Language structure of pattern Sturmian words / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1017/s014338571000074x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2128501256 / rank | |||
Normal rank | |||
Latest revision as of 12:18, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Uniform sets and super-stationary sets over general alphabets |
scientific article |
Statements
Uniform sets and super-stationary sets over general alphabets (English)
0 references
18 October 2011
0 references
