Which of the following statement is false?...

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

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Let G = (V, T, S, P) be a context-free grammar such that every one of its productions is of the form A ? ?, with |?| = k > 1. The derivation tree for any string W ? L (G) has a height such that

h<((|W| - 1)/k-1)

log_k|W| < h

log_k|W| < h < ((|W| - 1)/k-1)

log_k|W| <= h <= ((|W| - 1)/k-1)

Discussion

MCQ

Which of the following does the given Mealy machine represents?

Discussion

MCQ

Context free languages are closed under-

Union, Intersection

Union, Kleene closure

Intersection, Complement

Complement, Kleene closure

Discussion

MCQ

Consider the following context-free grammar over the alphabet ? = {a, b} with S as the start symbol:

S ? AT 
A ? aAa | bAb | #T 
T ? aT | bT | ?

Which of the following represents the language generated by the above grammar?

{ w#x | w^R is a substring of x, where w, x ? {a, b}* }

{ w#x | w is a substring of x, where w, x ? {a, b}* }

x#w | w^R is a substring of x, where w, x ? {a, b}* }

{ w#x | w, x ? {a, b}* }

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

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