In the correct grammar of above question, what is the length...

MCQ

In the correct grammar of above question, what is the length of the derivation (number of steps starring from S) to generate the string a^lb^m with l ? m?

max(l,m) + 2

l + m + 2

l + m + 3

max(l, m) + 3

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Let L = {0ⁿ1ⁿ|n ? 0} be a context free language. Which of the following is correct ?

L` is context free and L^k is not context free for any k ? 1.

L` is not context free and L^k is not context free for any k ? 1

Both L` and L^k is for any k ? 1 are context free.

Both L` and L^k is for any k ? 1 are not context free

Discussion

MCQ

Which among the following cannot be accepted by a regular grammar ?

L is a set of numbers divisible by 2

L is a set of binary complement

L is a set of string with odd number of 0

L is a set of 0ⁿ1ⁿ

Discussion

MCQ

Let L = L1?L2, where L1 and L2 are languages as defined below:

L1 = {a^{m}b^{m}ca^{n}b^{n} | m, n >= 0 }
L2 = {a^{i}b^{j}c^{k} | i, j, k >= 0 }
Then L is

Not recursive

Regular

Context free but not regular

Recursively enumerable but not context free

Discussion

MCQ

Which of the following are context free?

A = {anbnambm | m, n>=0}
B = {ambnambn | m, n>=0}
C = {ambn | m?2n,m, n>=0}

A and B only

A and C only

B and C only

C only

Discussion

MCQ

Given the following two statements : A. L = {w|n_a(w) = n_b(w)} is deterministic context free language, but not linear. B. L = {aⁿ bⁿ} ? {aⁿ b²ⁿ} is linear, but not deterministic context free language. Which of the following options is correct ?

Both (A) and (B) are false

Both (A) and (B) are true

(A) is true, (B) is false.

(A) is false, (B) is true

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