(1)
Which of the following conversion is not possible (algorithmically)?
Answer: nondeterministic PDA to deterministic PDA
Answer: nondeterministic PDA to deterministic PDA
Answer: context-free languages are closed under intersection
Article and Schedule Quiz | Start Test! |
Answer: (r*s*)* = (r + s)*
Answer: R1 n R2 neet not be regular
Answer: a proper superset of CFL
Answer: membership problem for type 0 languages
Answer: complementation
Answer: All non-regular languages can be generated by CFGs.
I. Recursive languages are closed under complementation
II. Recursively enumerable languages are closed under union
III. Recursively enumerable languages are closed under complementation
Which of the above statement are TRUE?Answer: I and II
Answer: recursively enumerable
Answer: aaabb
P : S ? aS|aA T = {a, b}
A ? bA|b
Which of the following regular expression denotes L(G)?Answer: aa*bb*
Answer: Ackermann’s function
Answer: ababa
Answer: ((a + b)(a + b)(a + b))*
Answer: regular
Answer: REG ? CFL ? CSL ? type0
Answer: 120
Answer: all of the above
Answer: (a + b)*
Missiles Mock Test | Start Test! |
SSC MTS Mock Test | Start Test |
IBPS CLERK MOCK TEST | Start Test |
SSC MTS 2022 JULY 26 Shift 1 (ENGLISH) | Start Test! |
SSC GD Previous Year Paper 2021 Nov 17 Shift - I (Hindi) | Start Test! |
SSC CGL Tier - 1 PYP 2022 April 21 Shift- 1 (ENGLISH) | Start Test! |
MPSC PAPER I MOCK TEST 1 (ENGLISH) | Start Test! |
IB Security Assistant Mock test 1 (english) | Start Test! |
UP POLICE CONSTABLE MOCK TEST 1 | Start Test! |
DELHI POLICE CONSTABLE MOCK TEST 1 (HINDI) | Start Test! |