Which one of the following statement is FALSE?...

MCQ

Which one of the following statement is FALSE?

Context-free languages are closed under union

Context-free languages are closed under concatenation

Context-free languages are closed under intersection

Context-free languages are closed under Kleene closure

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

For the correct answer strings to above question, how many derivation trees are there?

Discussion

MCQ

If the strings of a language L can be effectively enumerated in lexicographic (i.e., alphabetic) order, which of the following statements is true ?

L is necessarily finite

L is regular but not necessarily finite

L is context free but not necessarily regular

L is recursive but not necessarily context free

Discussion

MCQ

Consider the following grammar.

S -> AB
A -> a
A -> BaB
B -> bbA

Which of the following statements is FALSE?

The length of every string produced by this grammar is even

No string produced by this grammar has three consecutive a's

The length of substring produced by B is always odd

No string produced by this grammar has four consecutive b's

Discussion

MCQ

Which of the expression is appropriate?
For production p: a->b where a?V and b?_______

(V+?)*

V+ ?

Discussion

MCQ

Which variable does not drive a terminal string in grammar? S -> AB A -> a B -> b B -> C

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