Which of the following statements is true?...

MCQ

Which of the following statements is true?

If a language is context free it can always be accepted by a deterministic push-down automaton

The union of two context free languages is context free

The intersection of two context free languages is context free

The complement of a context free language is context free

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Consider the following languages.

L₁ = {aⁱ b^j c^k | i = j, k ? 1}
L₁ = {aⁱ b^j | j = 2i, i ? 0}
Which of the following is true?

L1 is not a CFL but L2 is

	L1 ? L2 = ? and L1 is non-regular

	L1 ? L2 = ? and L1 is non-regular

There is a 4-state PDA that accepts L1, but there is no DPDA that accepts L2

Discussion

MCQ

Push down automata accepts which language?

Context sensitive language

Context free language

Recursive language

None of the mentioned

Discussion

MCQ

A PDA machine configuration (p, w, y) can be correctly represented as:

(current state, unprocessed input, stack content)

(unprocessed input, stack content, current state)

(current state, stack content, unprocessed input)

none of the mentioned

Discussion

MCQ

If we use internal data forwarding to speed up the performance of a CPU (R1, R2 and R3 are registers and M[100] is a memory reference), then the sequence of operations

Discussion

MCQ

The instantaneous description is PDA shows

Present state

Stack symbol

String to be processed

All 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