Menu

Question Discussion & Solution

MCQ
Q. 
Given the following two languages : L1 = {an bn | n ? 0, n ? 100} L2 = {w ? {a, b, c}*| na(w) = nb(w) = nc(w)} Which of the following options is correct ?

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.
Consider the following statements about the context free grammar G = {S-->SS , S-->ab , S-->ba , S-->^} I. G is ambiguous II. G produces all strings with equal number of a
forum Discussion
MCQ
2. 
Let G = (V, T, S, P) be a context-free grammar such that every one of its productions is of the form A ? v, with |v| = K > 1. The derivation tree for any W ? L(G) has a height h such that
forum Discussion
MCQ
3.
The Grammar can be defined as: G=(V, ?, p, S)
In the given definition, what does S represents?
forum Discussion
MCQ
4.
Context sensitive language can be recognized by a :
forum Discussion
MCQ
5.
Given the following two statements : A. L = {w|na(w) = nb(w)} is deterministic context free language, but not linear. B. L = {an bn} ? {an b2n} is linear, but not deterministic context free language. Which of the following options is correct ?
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