in Theory of Computation retagged by
390 views
1 vote
1 vote

in Theory of Computation retagged by
390 views

1 Answer

7 votes
7 votes
Best answer
We can reduce this to

$$L = \{0^n1^n0^m \mid n\geq 0, m \leq n\}.$$

We cannot make a PDA for this as we need to do 2 indefinite counts. But we can do this with an LBA and so $L$ is CSL. Answer should be B choice.
selected by
by

Related questions