Abstract
Combinatorics on words and symbolic dynamics are one of the new branches of mathematics and computer science. In this paper we investigate a class of words with low complexity function its related to digital problem. For a one-digit prime number, consider the sequence of first digit in the decimal representation of powers of that prime number. We have shown that the complexity function of this sequence is a polynomial with degree one, and we find an explicit formula for it.
| Original language | English |
|---|---|
| Title of host publication | 52nd Annual Iranian Mathematics Conference, AIMC 2021 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 13-15 |
| Number of pages | 3 |
| ISBN (Electronic) | 9781728171760 |
| DOIs | |
| State | Published - 2021 |
| Externally published | Yes |
| Event | 52nd Annual Iranian Mathematics Conference, AIMC 2021 - Kerman, Iran, Islamic Republic of Duration: 30 Aug 2021 → 2 Sep 2021 |
Publication series
| Name | 52nd Annual Iranian Mathematics Conference, AIMC 2021 |
|---|
Conference
| Conference | 52nd Annual Iranian Mathematics Conference, AIMC 2021 |
|---|---|
| Country/Territory | Iran, Islamic Republic of |
| City | Kerman |
| Period | 30/08/21 → 2/09/21 |
Bibliographical note
Publisher Copyright:© 2021 IEEE.
Keywords
- Combinatorics on words
- Complexity functions
- Digital problems
- Symbolic dynamics