7 citations · 13 across the 3 of their papers we have counts for
3 papers
cs.LO2019
On the incomputability of computable dimension
Ludwig Staiger
Using an iterative tree construction we show that for simple computable subsets of the Cantor space Hausdorff, constructive and computable dimensions might be incomputable.
cs.FL2010★ 6 cited
The Maximal Subword Complexity of Quasiperiodic Infinite Words
Ronny Polley, Ludwig Staiger
We provide an exact estimate on the maximal subword complexity for quasiperiodic infinite words. To this end we give a representation of the set of finite and of infinite words hav…
nlin.CD2003★ 7 cited
Randomness Relative to Cantor Expansions
Cristian S. Calude, Ludwig Staiger, Karl Svozil
Imagine a sequence in which the first letter comes from a binary alphabet, the second letter can be chosen on an alphabet with 10 elements, the third letter can be chosen on an alp…