From the 1 of 1 linked paper with an AI index.
1 paper
Bjørn Kjos-Hanssen
The paper proves that every finite string has probabilistic automatic complexity at most three by constructing an explicit three‑state probabilistic finite automaton that makes the…