565 views
0 votes
0 votes
Consider the machines,

M1 - a NPDA accepting L1,

M2 - a 2 way PDA accepting L2,

M3 - a PDA with two stacks accepting L3.

Choose the false statement,

1) For any CFL L, there exists some M1, M2 and M3.

2) For some CSL L, there exists some M1,M2 and M3.

3) For every recursive set, there exists some M1,M2 and M3.

4) The power of the machines are not M1 <= M2 < M3.

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
0 votes
0 votes
0 answers
2
anupamsworld asked Sep 1, 2022
269 views
Construct PDA using empty stack method for the given language.$L=\left \{ x \space\ | \space\ x\in \left \{ a,b \right \}^{*} ; n_{a}(x) >= n_{b}(x) \right \}$//number of...
0 votes
0 votes
0 answers
3
raj_uddeshya157 asked Dec 27, 2023
77 views
Can $\Sigma^{*}$ be called DCFL? If yes, what would the state transition diagram of its PDA look like?
1 votes
1 votes
1 answer
4