Are there any known languages that require $o(\log n)$ space but are also not regular?  I'm looking for a problem just below undirected connectivity.
Nonregular Languages in Sublogarithmic Space
cc.complexity theory;space complexity
Yes. I think the main reference is Turing Machines with Sublogarithmic Space by Szepietowski (1994). (Link to books.google)