Question Discussion & Solution

MCQ

In pumping lemma for context free language

We start by assuming the given language is context free and then we get contradict

We first convert the given language into regular language and then apply steps on

Both (a) and (b)

None of these

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Which of the following statement is false?

If L is context free language then L* is also a context free language

If L1 and L2 are context free language then there intersection is not a context free language

If L1 and L2 are context free language then there union is also a context free language

None of these

Discussion

MCQ

The CYK algorithm start with

Chomsky normal form grammar

Greibach normal form grammar

Both (a) and (b)

None of these

Discussion

MCQ

In pumping lemma for context free language

We start by assuming the given language is context free and then we get contradict

We first convert the given language into regular language and then apply steps on

Both (a) and (b)

None of these

Discussion

MCQ

The CYK algorithm is also known as

Table filling algorithm

Pumping lemma

Both (a) and (b)

None of these

Discussion

MCQ

Context free grammar is closed under

Union

Intersection

Both

None of these

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Theory of Automata Topics

Reqular Expressions

Finite Automata

Context Free Grammars

Push Down Automata

Regular and context free languages

Pumping Lemma

Turning Machine

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Theory of Automata Topics

Reqular Expressions

Finite Automata

Context Free Grammars

Push Down Automata

Regular and context free languages

Pumping Lemma

Turning Machine

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Theory of Automata Topics