Streaming algorithms for language recognition problems

Streaming Algorithms for Recognizing Nearly Well-Parenthesized Expressions

“…In [5] membership testing for other classes of languages was considered. In [4] it was proved that any randomized T pass algorithm (passes made in any direction) for testing membership in a deterministic context-free language requires Ω(n/T ) space.…”