Menu

Question Discussion & Solution

MCQ
Q.
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?

forum Community Discussion

speaker_notes_off

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

login Login to Discuss

auto_awesome Similar Questions

MCQ
1.
The set of all strings over ? = {a,b} in which all strings that starts with and ends with same letter is--------
forum Discussion
MCQ
2.
The context free grammar S ? A111|S1, A ? A0 | 00 is equivalent to _________
forum Discussion
MCQ
3.
Grammar that produce more than one Parse tree for same sentence is ___________
forum Discussion
MCQ
4.
Which among the following is the missing transition in the given DFA?
L= {x??= {a, b} | x starts with a and ends with b}

forum Discussion
MCQ
5.
The Grammar can be defined as: G=(V, ?, p, S)
In the given definition, what does S represents?
forum Discussion

category More Theory of Automata Topics

article

Reqular Expressions

format_list_bulleted 114 MCQs
Practice arrow_forward
article

Finite Automata

format_list_bulleted 44 MCQs
Practice arrow_forward
article

Context Free Grammars

format_list_bulleted 76 MCQs
Practice arrow_forward
article

Push Down Automata

format_list_bulleted 37 MCQs
Practice arrow_forward
article

Regular and context free languages

format_list_bulleted 65 MCQs
Practice arrow_forward
article

Pumping Lemma

format_list_bulleted 14 MCQs
Practice arrow_forward
article

Turning Machine

format_list_bulleted 14 MCQs
Practice arrow_forward