Regular expressions with backreferences and lookaheads (REWBLk) capture the class of languages accepted by nondeterministic log-space Turing machines (NLOG).
