Register
Filter

Questions by manisha11

980
views
1 answers
2 votes
Sets ,DM
Let P ( S ) denotes the power set of the set S, the dual of the lattice ( P(S), ⊆ ) is a) Doesn't’t exist b) ( P(S), ⊆ ) c) ( P(S), ⊇ ) d) ( S,⊇)
1.3k
views
1 answers
1 votes
TOC, RL
Consider the followingS1: Pumping lemma is used to prove, that particular language is not regularS2: For all DCFL there exist LR(k) grammar but LL(k) may not exist.Which ...
1.0k
views
2 answers
1 votes
TOC, RL
Consider the following language L = {w ∈ (a+b)* | w has atleast as many occurrences of (bba)’s as (abb)’s}. Which of the following statements is/are true?S1: Langua...
799
views
2 answers
2 votes
TOC decidability
Let <M be the encoding of Turing machine as a string over Σ = {0, 1}. Let L = {<M | M is TM on input w will visit some state P}.The language L is(a) Decidable(b) Undecid...
325
views
0 answers
0 votes
Theory Of Computation , Decidability
9. Let L ≤ ML’ denote the language L is mapping reducible (many to one reducible) to language L’. Which one of the following is True?(a) If L ≤ pL’ and L’ is ...
Page: