#### Filter Results:

#### Publication Year

2014

2015

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Shallit and Wang studied deterministic automatic complexity of words. They showed that the automatic Hausdorff dimension I(t) of the infinite Thue word satisfies 1/3 I(t) 1/2. We improve that result by showing that I(t) = 1/2. We prove that the nondeterministic automatic complexity A N (x) of a word x of length n is bounded by b(n) := n/2 + 1. This enables… (More)

Shallit and Wang studied deterministic automatic complexity of words. They showed that the automatic Hausdorff dimension I(t) of the infinite Thue word satisfies 1/3 ≤ I(t) ≤ 2/3. We improve that result by showing that I(t) ≥ 1/2. For nondeterministic automatic complexity we show I(t) = 1/2. We prove that such complexity AN of a word x of length n satisfies… (More)

- ‹
- 1
- ›