Database-Management-System
November 9, 2023Computer-Networks
November 9, 2023NTA UGC NET JUNE-2023 Paper-2
| Question 3 |
Which of the following statement is correct ?
1.Ackermann’s function is primitive recursive
2.L={anbkcn+k:n>=0,k>=0} is regular language
3.L={anbj:n=j2} is not context free language
4.For every context sensitive language L not including LAmda, there exist some linear bounded automata M such that L != L(M))
1.Ackermann’s function is primitive recursive
2.L={anbkcn+k:n>=0,k>=0} is regular language
3.L={anbj:n=j2} is not context free language
4.For every context sensitive language L not including LAmda, there exist some linear bounded automata M such that L != L(M))
| 1 | |
| 2 | |
| 3 | |
| 4 |
Question 3 Explanation:
Ackermann’s function is not primitive recursive.
L=L={anbkcn+k:n>=0,k>=0} is a context-free language.
For every context-sensitive language L (not including Lambda), there exists a linear bounded automaton M such that L = L(M).
So, the correct statement is option 3.
L=L={anbkcn+k:n>=0,k>=0} is a context-free language.
For every context-sensitive language L (not including Lambda), there exists a linear bounded automaton M such that L = L(M).
So, the correct statement is option 3.
Correct Answer: C
Question 3 Explanation:
Ackermann’s function is not primitive recursive.
L=L={anbkcn+k:n>=0,k>=0} is a context-free language.
For every context-sensitive language L (not including Lambda), there exists a linear bounded automaton M such that L = L(M).
So, the correct statement is option 3.
L=L={anbkcn+k:n>=0,k>=0} is a context-free language.
For every context-sensitive language L (not including Lambda), there exists a linear bounded automaton M such that L = L(M).
So, the correct statement is option 3.
Subscribe
Login
0 Comments