adplus-dvertising
frame-decoration

Question

Assume statements S1 and S2 defined as :

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 ?

a.

S1 is correct and S2 is not correct

b.

Both S1 and S2 are correct

c.

Both S1 and S2 are not correct

d.

S1 is not correct and S2 is correc

Answer: (b).Both S1 and S2 are correct

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Assume statements S1 and S2 defined as : S1 : L2-L1 is recursive enumerable where L1 and L2 are recursive and recursive enumerable respectively. S2 : The set of all Turing...

Similar Questions

Discover Related MCQs

Q. Non-deterministic pushdown automaton that accepts the language generated by the grammar:

S→aSS | ab is

(A) δ(q0, λ, z) = { (q1, z)};
δ(q0, a, S) = { (q1, SS)}, (q1, B) }
δ(q0, b, B) = { (q1, λ)},
δ(q1, λ, z) = { (qf, λ)}

(B) δ(q0, λ, z) = { (q1, Sz)};
δ(q0, a, S) = { (q1, SS)}, (q1, B) }
δ(q0, b, B) = { (q1, λ)},
δ(q1, λ, z) = { (qf, λ)}

(C) δ(q0, λ, z) = { (q1, Sz)};
δ(q0, a, S) = { (q1, S)}, (q1, B) }
δ(q0, b, λ) = { (q1, B)},
δ(q1, λ, z) = { (qf, λ)}

(D) δ(q0, λ, z) = { (q1, z)};
δ(q0, a, S) = { (q1, SS)}, (q1, B) }
δ(q0, b, λ) = { (q1, B)},
δ(q1, λ, z) = { (qf, λ)}

Q. Given L1 = L(a*baa*) and L2 = L(ab*)
The regular expression corresponding to language L3 = L1/L2 (right quotient) is given by

Q. Given the production rules of a grammar G1 as

S1→AB | aaB
A→a | Aa
B→b

and the production rules of a grammar G2 as

S2→aS2bS2 | bS2aS2 | λ

Which of the following is correct statement?

Q. Given a grammar : S1→Sc, S→SA|A, A→aSb|ab, there is a rightmost derivation S1=>Sc =>SAC=>SaSbc. Thus, SaSbc is a right sentential form, and its handle is

Q. The equivalent production rules corresponding to the production rules

S→Sα1|Sα2|β1|β2 is

Q. Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively transition table as given below

The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is

Q. The grammar with production rules S → aSb |SS|λ generates language L given by:

Q. A pushdown automation M = (Q, Σ, Γ, δ, q0, z, F) is set to be deterministic subject to which of the following condition(s), for every q ∈ Q, a ∈ Σ ∪ {λ} and b ∈ Γ
(s1) δ(q, a, b) contains at most one element
(s2) if δ(q, λ, b) is not empty then δ(q, c, b) must be empty for every c ∈ Σ

Q. For every context free grammar (G) there exists an algorithm that passes any w ∈ L(G) in number of steps proportional to

Q. Match the following:

a. Context sensitive language          i. Deterministic finite automation
b. Regular grammar                            ii. Recursive enumerable
c. Context free grammar                     iii. Recursive language
d. Unrestricted grammar                     iv. Pushdown automation

Codes:
      a   b    c   d

Q. The statements s1 and s2 are given as:

s1: Context sensitive languages are closed under intersection, concatenation, substitution and inverse homomorphism.
s2: Context free languages are closed under complementation, substitution and homomorphism.

Which of the following is correct statement?

Q. Consider the following statements :

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 ?

Q. Given the following statements :

(i) The power of deterministic finite state machine and nondeterministic finite state machine are same.
(ii) The power of deterministic pushdown automaton and nondeterministic pushdown automaton are same.

Which of the above is the correct statement(s) ?

Q. Which is not the correct statement(s) ?

(i) Every context sensitive language is recursive.
(ii) There is a recursive language that is not context sensitive.

Q. Which one of the following is not a Greibach Normal form grammar?

(i)            S ->a|bA|aA|bB
A->a
B->b
(ii)           S->a|aA|AB
A->a
B->b
(iii)          S->a|A|aA
A->a

Q. The equivalent grammar corresponding to the grammar G:S→aA,A→BB,B→aBb∣εG:S→aA,A→BB,B→aBb∣ε is

Q. Consider the regular expression (a + b) (a + b) … (a + b) (n-times). The minimum number of states in finite automaton that recognizes the language represented by this regular expression contains

Q. The following CFG

S->aB|bA, A->a|as|bAA, B->b|bs|aBB

generates strings of terminals that have

Q. Match the following :

(i) Regular Grammar                           (a) Pushdown automaton
(ii) Context free Grammar                   (b) Linear bounded automaton
(iii) Unrestricted Grammar                  (c) Deterministic finite automaton
(iv) Context Sensitive Grammar        (d) Turing machine
     
(i)   (ii)   (iii)  (iv)

Q. Which one of the following statement is false?