Answer: PDA
Article and Schedule Quiz | Start Test! |
1) Does a given program ever produce an output?
2) If L is context-free language, then, is ~L also context-free?
3) If L is regular language, then, is ~L also regular?
4) If L is recursive language, then, is ~L also recursive?
Answer: Boyson Jensen
Answer: F3,F4,F1,F5,F6,F2
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 statements are true ?Answer: I and II
Answer: Context-sensitive
S1 : L2-L1 is recursive enumerable where L1 and L2 are recursive and recursive enumerable respectively.
S2 : The set of all Turing machines is countable.
Which of the following is true ?Answer: Both S1 and S2 are not correct.
Answer: The language corresponding to the given grammar is a set of odd number of a s.
Answer: Languages recognizable by Turing machine
Answer: Decidable
Answer: Ackermann function
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! |