L versus NL

Let $L$ contain the decision problems solvable by deterministic Turing machines using $O(\log n)$ work space, and let $NL$ allow nondeterministic machines under the same space bound.

Is $L = NL$?