Menu

Question Discussion & Solution

MCQ
Q.
A regular Grammar is a _________

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.
Let LD  be the set of all languages accepted by a PDA by final state and LF  the set of all languages accepted by empty stack. Which of the following is true?

forum Discussion
MCQ
2.
With reference of a DPDA, which among the following do we perform from the start state with an empty stack?
forum Discussion
MCQ
3.
If we use internal data forwarding to speed up the performance of a CPU (R1, R2 and R3 are registers and M[100] is a memory reference), then the sequence of operations

forum Discussion
MCQ
4.
Consider the following context-free grammars:

Which one of the following pairs of languages is generated by G1 and G2, respectively

forum Discussion
MCQ
5.
Which of the following languages over {a,b,c} is accepted by a deterministic pushdown automata?\a. {wcwR ? w? {a,b}* } b. {wwR ? w? {a,b,c}* }c. {anbncn ? n ? 0 } d. {w ? w is a palindrome over {a,b,c} } Note: wR  is the string obtained by reversing 'w'
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