menu
search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

MadeEasy Test Series 2018: Theory of Computation - Non Determinism

1 vote
108 views

isn't the ans is 3 i.e p,q,r

in Theory of Computation
edited by 108 views
0
Yes ! Correct answer is $3$ i think they have omitted $'p'$ which should also be included.
0
thanks!!

Please log in or register to answer this question.

← Prev. Next →
← Prev. Qn. in Sub. Next Qn. in Sub. →

Related questions

2 votes
0 answers
1
101 views
MadeEasy Test Series 2018: Theory of Computation - Decidability
Consider the following statements: S1 : Let L be language, reversal of language L cannot contain any string present in ‘L’ except ‘∈’. S2 : Concatenation of two different language cannot be commutative until atleast one of them is ‘Φ’ or ‘∈’. Which of the following is correct?
Consider the following statements: S1 : Let L be language, reversal of language L cannot contain any string present in ‘L’ except ‘∈’. S2 : Concatenation of two different language cannot be commutative until atleast one of them is ‘Φ’ or ‘∈’. Which of the following is correct?
asked Jan 17, 2018 in Theory of Computation Sukhdip Singh 101 views
3 votes
0 answers
2
1.4k views
MadeEasy Test Series 2018: Theory of Computation - Turing Machine
Consider the following language over Σ = {0, 1}:L = {<M>|M is TM that accept all strings of length at most 5} Which of the following is true? (A) Decidable and REC (B) Undecidable and RE (C) Undecidable and non RE (D) Decidable but RE
Consider the following language over Σ = {0, 1}:L = {<M>|M is TM that accept all strings of length at most 5} Which of the following is true? (A) Decidable and REC (B) Undecidable and RE (C) Undecidable and non RE (D) Decidable but RE
asked Jan 12, 2018 in Theory of Computation Bhavya Bhatia 1.4k views
3 votes
1 answer
3
655 views
MadeEasy Test Series 2018: Set Theory & Algebra- Lattice
Consider statements: S1 : A finite lattice is always bounded. S2 : Complemented lattice is a proper subset of bounded lattice. S3 : A bounded and complemented lattice may or may not be a distributive lattice. Which of the following is/are ... D as per the solution my doubt is a lattice can be semi bounded and not Bounded then why S1 is true.
Consider statements: S1 : A finite lattice is always bounded. S2 : Complemented lattice is a proper subset of bounded lattice. S3 : A bounded and complemented lattice may or may not be a distributive lattice. Which of the following is/are true? A.) S1 and S2 only B.)S2 and ... S2 and S3 Answer is D as per the solution my doubt is a lattice can be semi bounded and not Bounded then why S1 is true.
asked Jan 12, 2018 in Set Theory & Algebra ashish pal 655 views
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...