Separating many words by counting occurrences of factors (Q2327561): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2966724346 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1905.07223 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 04:12, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Separating many words by counting occurrences of factors |
scientific article |
Statements
Separating many words by counting occurrences of factors (English)
0 references
15 October 2019
0 references
combinatorics on words
0 references
regular language
0 references
infinite word
0 references
\(k\)-abelian equivalence
0 references
separating words problem
0 references
