Disjunctive Omega-Words and Real Numbers
| dc.creator | Hertling,Peter | |
| dc.date | 1996 | |
| dc.date.accessioned | 2024-02-06T12:48:25Z | |
| dc.date.available | 2024-02-06T12:48:25Z | |
| dc.description | An ω-word p over a finite alphabet Σ is called disjunctive if every finite word over Σ occurs as a subword in p. A real number is called disjunctive to base a if it has a disjunctive a-adic expansion. For every pair of integers a,b ≥ 2 such that there exist numbers disjunctive to base a but not to base b we explicitly construct very simple examples of such numbers. General versions of the following results are proved. If (ni)i∈ω is a strictly increasing sequence of positive integers with ni+1 ≥ 3ni for infinitely many i then Σ 3-ni is disjunctive to base 2. The number Σ2-i!-i is disjunctive to base a if a is even and not a power of 2. The sum Σ2-ci is disjunctive to base 6 if c ≥ 3 is odd. | |
| dc.format | text/html | |
| dc.identifier | https://doi.org/10.3217/jucs-002-07-0549 | |
| dc.identifier | https://lib.jucs.org/article/27272/ | |
| dc.identifier.uri | https://openrepository.mephi.ru/handle/123456789/7014 | |
| dc.language | en | |
| dc.publisher | Journal of Universal Computer Science | |
| dc.relation | info:eu-repo/semantics/altIdentifier/eissn/0948-6968 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/pissn/0948-695X | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.rights | J.UCS License | |
| dc.source | JUCS - Journal of Universal Computer Science 2(7): 549-568 | |
| dc.subject | ω-words | |
| dc.subject | number representations | |
| dc.subject | invariant properties | |
| dc.subject | disjunctiveness | |
| dc.subject | normality | |
| dc.subject | periods of rational numbers | |
| dc.title | Disjunctive Omega-Words and Real Numbers | |
| dc.type | Research Article |