Answer: None of these
Answer: None of these
Answer: None of the above
Article and Schedule Quiz | Start Test! |
(1) For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine.
(2) Turing recognizable languages are closed under union and complementation.
(3) Turing decidable languages are closed under intersection and complementation
(4) Turing recognizable languages are closed under union and intersection.
Answer: 2 only
Answer: 3
Answer: Equal number of a’s and b’s
Answer: Terminal table
Answer: Two or more
Answer: Have same number of states and edges
Answer: Compiler lexical analysis
(i) Every context sensitive language is recursive.
(ii) There is a recursive language that is not context sensitive.
Answer: is true and (ii) is true.
1) abaabaaabaa
2) aaaabaaaa
3) baaaaabaaaab
4) baaaaabaa
Answer: 1, 2 and 4
Answer: Context-free languages are closed under Kleene closure
Answer: It cannot remember arbitrary large amount of information
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! |