Menu

Question Discussion & Solution

MCQ
Q.
Grammars that can be translated to DFAs is ___________

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 language L={0?1?0?| m ? 1} is a
forum Discussion
MCQ
2.
Assume the statements S1 and S2 given as:S1: Given a context free grammar, there exists an algorithm for determining whether L (G) is infinite.
S2: There exists an algorithm to determine whether two context free grammars generate the same language.
Which of the following is true?
forum Discussion
MCQ
3.
Let G = (V, T, S, P) be a context-free grammar such that every one of its productions is of the form A ? ?, with |?| = k > 1. The derivation tree for any string W ? L (G) has a height such that
forum Discussion
MCQ
4.
The minimum number of productions required to produce a language consisting of palindrome strings over ?={a,b} is
forum Discussion
MCQ
5.
The language accepted by this DFA is ---

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