Complexity of comparison unary>binary What is the smallest widely-known complexity class to which 
$$\left\{\langle i,j\rangle\middle|\begin{array}{@{}l@{\ }l@{}} &amp; i\ \text{is a unary encoding of a positive integer}\ \hat\imath\\\land &amp; j\ \text{is a binary encoding of a nonnegative integer}\ \hat\jmath\\\land &amp; \hat\imath&gt;\hat\jmath\end{array}\right\}$$
belongs to? The language is probably nonregular, but definitely in DLOGSPACE. Does this language lie in any smaller well-known class?
The problem is in coNLOGTIME, for example using the following algorithm. As is well known, one can determine the length of input $n$ in binary in DLOGTIME. Then, read off at most $\log n$ bits from the end of the input to find $j$ (if it is longer, reject). This also determines $i=n-1-\lfloor\log(j+1)\rfloor$ (I am assuming one character for the separator), so it remains to check that $i&gt;j$, and that the beginning of the input is indeed a valid unary encoding: only the last part uses nondeterminism. (That is, the problem would be in DLOGTIME if it were defined so that any string of length $i$ counted as a unary encoding of $i$.)