Context free languages are closed under-...

MCQ

Context free languages are closed under-

Union, Intersection

Union, Kleene closure

Intersection, Complement

Complement, 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

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

(V+?)*

V+ ?

Discussion

MCQ

The entity which generate Language is termed as:

Automata

Tokens

Grammar

Data

Discussion

MCQ

Consider 2 scenarios:

C1: For DFA (?, ?, ?, qo, F),
         if F = ?, then L = ?*
C2: For NFA (?, ?, ?, qo, F),
         if F = ?, then L = ?*
Where F = Final states set
? = Total states set

Choose the correct option ?

Both are true

Both are False

C1 is true, C2 is false

C1 is false, C2 is true

Discussion

MCQ

Which of the following pairs have DIFFERENT expressive power?

Deterministic finite automata(DFA) and Non-deterministic finite automata(NFA)

Deterministic push down automata(DPDA)and Non-deterministic push down automata(NPDA)

Deterministic single-tape Turing machine and Non-deterministic single-tape Turing machine

Single-tape Turing machine and multi-tape Turing machine

Discussion

MCQ

The context free grammer S->SS | oS1 | 1So | e generates

Equal number of O's and 1's

Unequal number of O's and 1's

Number of O's followd by any number of 1's

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