on an algorithm for multiperiodic words
Clicks: 83
ID: 217430
2013
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
24.6
/100
83 views
6 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #158 of 188 articles by views in the journal of nutrition
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 188 in total.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
We consider an algorithm by Tijdeman and Zamboni constructing a word of length k thathas periods p1, . . . , pr, and the richest possible alphabet. We show that this algorithm can be easilystated and its correctness briefly proved using the class equivalence approach.
| Reference Key |
holub2013actaon
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Štepán Holub |
| Journal | the journal of nutrition |
| Year | 2013 |
| DOI |
DOI not found
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.