adplus-dvertising
frame-decoration

Question

A language is accepted by a push down automata if it is:

a.

regular

b.

context free

c.

both a and b

d.

none of the mentioned

Answer: (c).both a and b

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. A language is accepted by a push down automata if it is:

Similar Questions

Discover Related MCQs

Q. Which of the following is an incorrect regular expression identity?

Q. Which of the following strings do not belong the given regular expression?
(a)*(a+cba)

Q. Which of the following regular expression allows strings on {a,b}* with length n where n is a multiple of 4.

Q. Which of the following strings is not generated by the given grammar:
S->SaSbS|e

Q. abb*c denotes which of the following?

Q. The following denotion belongs to which type of language:
G=(V, T, P, S)

Q. Context free grammar is called Type 2 grammar because of ______________ hierarchy.

Q. a→b
Restriction: Length of b must be atleast as much length of a.

Which of the following is correct for the given assertion?

Q. From the definition of context free grammars,
G=(V, T, P, S)

What is the solution of VÇT?

Q. If P is the production, for the given statement, state true or false.
P: V->(V∑T)* represents that the left hand side production rule has no right or left context.

Q. There exists a Context free grammar such that:
X->aX

Which among the following is correct with respect to the given assertion?

Q. If the partial derivation tree contains the root as the starting variable, the form is known as:

Q. Find a regular expression for a grammar which generates a language which states :
L contains a set of strings starting wth an a and ending with a b, with something in the middle.

Q. Which of the following is the correct representation of grammar for the given regular expression?
a(aUb)*b

Q. A CFG consist of the following elements:

Q. A CFG for a program describing strings of letters with the word “main” somewhere in the string:

Q. CFGs are more powerful than:

Q. State true or false:
S-> 0S1|01

Statement: No regular expression exists for the given grammar.

Q. For the given set of code, the grammar representing real numbers in Pascal has error in one of the six lines. Fetch the error.
(1) ->

(2) -> | epsilon

(3) -> | epsilon

(4) -> ‘E’ | epsilon

(5) -> + | – | epsilon

(6) -> 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9

Q. Which among the following is incorrect with reference to a derivation tree?