The number of binary cube-free words of length up to 47 and their numerical analysis (Q4700079): Difference between revisions
From MaRDI portal
Changed an 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.1080/10236199908808196 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2064936687 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Goulden—Jackson cluster method: extensions, applications and implementations / rank | |||
Normal rank | |||
Latest revision as of 08:49, 29 May 2024
scientific article; zbMATH DE number 1355424
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The number of binary cube-free words of length up to 47 and their numerical analysis |
scientific article; zbMATH DE number 1355424 |
Statements
The number of binary cube-free words of length up to 47 and their numerical analysis (English)
0 references
5 July 2000
0 references
binary cube-free words
0 references
