The class \(\mathsf {LogCFL}\)  consists of all
problems that are logspace reducible to a context-free language.
The class \(\mathsf {LogCFL}\)  is included in the parallel complexity class
\(\mathsf {NC}^2\)  and has several alternative characterizations (see e.g.
[1]}, [2]}):
