Complexity of Linear Subsequences of $k$-Automatic Sequences

This article likely explores the computational complexity of identifying or analyzing linear subsequences within sequences generated by $k$-automatic systems. The focus is on a specific mathematical domain, likely number theory or theoretical computer science. The title suggests an investigation into the difficulty of predicting or understanding patterns within these subsequences.