Complexity zoo for unary languages Of course, some complexity results may collapse for unary languages but I wonder
if there is somewhere a survey summarizing the known results in this case: a kind of 
complexity zoo for unary languages. Would you know of such a reference ?
There is no Zoo-style reference yet, but a recent automata-theoretic survey of Giovanni Pighizzini has been useful to me, especially the slides from his talk.


Giovanni Pighizzini, Investigations on Automata and Languages over a Unary Alphabet, CIAA 2014.  doi:10.1007/978-3-319-08846-4_3