Conditional normality and finite-state dimensions revisited (Q6896765)

This paper establishes the equivalence of five different definitions of conditional finite-state dimension for binary infinite sequences: asymptotic block frequency, finite-state gambling, automatic complexity, superadditive complexity, and finite-state a priori complexity.\N\NWhile the equivalence of the block frequency and gambling approaches was the main result of [\textit{S. Nandakumar} et al., Inf. Comput. 298, Article ID 105156, 20 p. (2024; Zbl 07852925)], this paper demonstrates that these and other characterizations can be derived more simply and directly. It does so by extending classical equivalences from the unconditional theory of finite-state dimension to the conditional setting.