Assume Statement S1 and S2 defined as:S1:L2-L1 is recursive ...

MCQ

Assume Statement 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 Turnig machine is countable. Which of the following is true?

S1 is correct ans S2 is not correct

Both S1 and S2 are correct

Both S1 and S2 are not correct

S1 is not correct and S2 is correct

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

The context free grammar S ? SS | 0S1 | 1S0 | ? generates _________

Equal number of 0

Unequal number of 0

Number of 0

None of the mentioned

Discussion

MCQ

Given the following statements: (i) Recursive enumerable sets are closed under complementation. (ii) Recursive sets are closed under complements. Which is/are the correct statements?

I only

II only

Both I and II

Neither I nor II

Discussion

MCQ

Consider a CFG with the following productions. S ? AA | B A ? 0A | A0 | 1 B ? 0B00 | 1 S is the start symbol, A and B are non-terminals and 0 and 1 are the terminals. The language generated by this grammar is

{0ⁿ 10²ⁿ | n ? 1}

{0ⁱ 10^j 10^k | i, j, k ? 0} ? {0ⁿ 10²ⁿ | n ? l}

{0ⁱ 10^j | i, j ? 0} ? {0ⁿ 10²ⁿ | n ? l}

The set of all strings over {0, 1} containing at least two 0's

None of the above

Discussion

MCQ

Which of the following language(s) generates more than one parse tree for a string ?

L1 = {a^nb^mc^md^n ? {a, b, c, d}* | n, m ? 0} 
      ? {a^nb^nc^md^m ? {a, b, c, d}* | n, m ? 0} 

L2 = {a^nb^mc^m ? {a, b, c}* | n, m ? 0} 
      ? {a^nb^nc^m ? {a, b, c}* | n, m ? 0}

L3 = {a^nb^mc^p ? {a, b, c}* | n ? m; n, m ? 0} 
      ? {a^nb^mc^p ? {a, b, c}* | m ? p; n, m ? 0}

Only L1 and L2

Only L1 and L3

Only L2 and L3

All L1, L2, and L3

Discussion

MCQ

The set of all strings over ? = {0,1} in which all strings that beings and ends with 0 is--------

0(0+1)0

00(0+1)0

00(0+1)11

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Theory of Automata Topics

Reqular Expressions

Finite Automata

Context Free Grammars

Push Down Automata

Regular and context free languages

Pumping Lemma

Turning Machine

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Theory of Automata Topics

Reqular Expressions

Finite Automata

Context Free Grammars

Push Down Automata

Regular and context free languages

Pumping Lemma

Turning Machine

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Theory of Automata Topics