Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by manisha11
2
votes
1
answer
41
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,⊇)
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,⊇)
969
views
asked
Aug 14, 2018
Mathematical Logic
discrete-mathematics
set-theory&algebra
+
–
1
votes
1
answer
42
TOC, RL
Consider the following S1: Pumping lemma is used to prove, that particular language is not regular S2: For all DCFL there exist LR(k) grammar but LL(k) may not exist. Which of the above statements are true? (a) Only S1 (b) Only S2 (c) Only S1 and S2 (d) None of these
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.3k
views
asked
Aug 10, 2018
Theory of Computation
theory-of-computation
regular-language
finite-automata
+
–
1
votes
2
answers
43
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: Language L is regular. S2: Complement of L is CFL. S3: Complement of L is CSL. S4: Reversal of L is CFL.
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...
971
views
asked
Aug 10, 2018
Theory of Computation
theory-of-computation
regular-language
finite-automata
+
–
2
votes
2
answers
44
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) Undecidable but partially decidable (c) Undecidable and not even partially decidable (d) Not a decision problem
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...
770
views
asked
Aug 10, 2018
Theory of Computation
decidability
recursive-and-recursively-enumerable-languages
turing-machine
+
–
0
votes
0
answers
45
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 semidecidable then L is semidecidable. (b) If L ≤ pL’ and L is RE then L’ is RE. (c) If L ≤ pL’ and L is decidable then L’ decidable. (d) If L ≤ pL’ and L is recursive. Solution: Option (a) PLEASE Explain
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 ...
306
views
asked
Aug 10, 2018
Theory of Computation
theory-of-computation
decidability
turing-machine
+
–
Page:
« prev
1
2
3
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register