Push down automata excepts which language ?...

MCQ

Push down automata excepts which language ?

Context Sensitive Language

Context free Language

Recursive Language

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

Which of these does not belong to CFG?

Terminal Symbol

Non terminal Symbol

Start symbol

End Symbol

Discussion

MCQ

Regular expressions are used to represent which language?

Recursive language

Regular language

Context free language

All of the above.

Discussion

MCQ

Assume Statement S1 and S2 defined as:S1:L2-L1 is recursive enumerable Where L1 and L2 are recursive and recursive enumerable respectively. S2: The set of all Turnig machine is countable. Which of the following is true?

S1 is correct ans 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

Discussion

MCQ

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

(V+?)*

V+ ?

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

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