Maybe this is well-known, but I couldn't find any example of a non-regular lanugage that is decidable on a single-tape Turing machine in subquadratic time. Help!
Related paper: On the structure of one-tape nondeterministic turing machine time hierarchy by Kobayashi.
Related question: Why do we use single tape Turing machines for time complexity? by Kaveh.