Menu

Question Discussion & Solution

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

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.
Which of following statement(s) is/are not correct? (I) Languages generated by the grammar S?aSa ? aa is not regular. (II) Languages generated by the grammar S?aSb ? aa is not regular. (III) Languages generated by the grammar S?S1|S3, S1?aS1c |S2|?, S2?aS2b|?, S3?aS3b|S4| ?, S4?bS4c|? is {a^nb^mc^k | k = |n - m|, n?0, m?0, k?0}. (IV) Languages generated by the grammar S?S1S3, S1?aS1c |S2|?, S2?aS2b|?, S3?aS3b|S4| ?, S4?bS4c|? is {a^nb^mc^k | k = |n - m|, n?0, m?0, k?0}.
forum Discussion
MCQ
2.
====Which of the following operation can be applied on regular expressions?
forum Discussion
MCQ
3.
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?
forum Discussion
MCQ
4.
Recursively enumerable languages are not closed under ______________
forum Discussion
MCQ
5.
The context free grammer S->SS | oS1 | 1So |  e generates
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