Assume the statements S1 and S2 given as:S1: Given a context...

MCQ

Assume the statements S1 and S2 given as:S1: Given a context free grammar, there exists an algorithm for determining whether L (G) is infinite.
S2: There exists an algorithm to determine whether two context free grammars generate the same language.
Which of the following is true?

S1 is correct and S2 is not correct

Both S1 and S2 are correct

Both S1 and S2 are not correct

S1 is not correct and S2 is correct

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 following statement is false?

The CFG can be converted to Chomsky normal form

The CFG can be converted to Greibach normal form

CFG is accepted by pushdown automata

Discussion

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 expression is appropriate?
For production p: a->b where a?V and b?_______

(V+?)*

V+ ?

Discussion

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 variables

In derivation tree, if the root of a sub tree is X then it is called --tree

None of the mentioned

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

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