CFG (Context Free Grammar) is not closed under...

MCQ

CFG (Context Free Grammar) is not closed under

Union

Complementation

Kleene star

Product

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?

In derivation tree, the label of each leaf node is terminal

In derivation tree, the label of all nodes except leaf nodes is a variable

In derivation tree, if the root of a sub tree is X then it is called

None of the mentioned

Discussion

MCQ

Production Rule: aAb->agb belongs to which of the following category?

Regular Language

Context free Language

Context Sensitive Language

Recursively Ennumerable Language

Discussion

MCQ

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

Accepting State

Starting Variable

Sensitive Grammar

None of these

Discussion

MCQ

Which of the following statement is correct?

All Regular grammar are context free but not vice versa

All context free grammar are regular grammar but not vice versa

Regular grammar and context free grammar are the same entity

None of the mentioned

Discussion

MCQ

A regular Grammer is a ___________

CFG

Non CFG

English Grammer

None of the mentioned

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