minicomplexity
long length
 Given a long unary string, check that its length is exactly $2^h$.
 For every $h\geq 1$, long length$h$ (or just llen$h$) is defined over the unary alphabet $\{\mathtt0\}$. Its instances are all unary strings of length $\leq2^h$. The unary string of length exactly $2^h$ is the only positive instance. All other instances are negative. E.g., $\mathtt{00000000}$ is the only positive instance of llen$3$; all unary strings of length $\lt8$ are negative instances. (Strings of length $\gt8$ are not instances of the problem.)
 Introduced by Kapoutsis 2009, as a straightforward example of a problem in 22D\2D. (The original definition allowed arbitrarily long instances, but this is not essential in this context.) The name “long length” is suggested by this site. huh? See iterated long length for the variant where the length must be a multiple of $2^h$, and length for the variant where the length must be $h$.
1N
1N 1D re-1D re-1N co-1D rc-1D 1D/uny 1N/uny re-1D/uny re-1N/uny co-1D/uny rc-1D/uny
 – no record –
 – no record –
 – no record –