On the length of word chains (Q1108812): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
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/0020-0190(87)90031-7 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2028460486 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5585020 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3659988 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3689370 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4140407 / rank | |||
Normal rank |
Latest revision as of 18:59, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the length of word chains |
scientific article |
Statements
On the length of word chains (English)
0 references
1987
0 references
Word chains are an extension of addition chains to words. We show that over a q-letter alphabet, any long enough word admits a word chain of length at most \((1+\epsilon)n/\log_ q n\), for a fixed arbitrary \(\epsilon >0\); there exist words with no chain shorter than \(n/\log_{q- 1} n\). Several examples are given. Finally, we show that words with few factors have short chains.
0 references
D0L-systems
0 references
addition chains
0 references
word chain
0 references