Q. A language accepted by Deterministic Push down automata is closed under which of the following?

View solution

Q. Which of the following is a simulator for non deterministic automata?

View solution

Q. Finite-state acceptors for the nested words can be:

View solution

Q. Which of the following is analogous to the following?
:NFA and NPDA

View solution

Q. Let T={p, q, r, s, t}. The number of strings in S* of length 4 such that no symbols can be repeated.

View solution

Q. Which of the following relates to Chomsky hierarchy?

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

Q. abb*c denotes which of the following?

View solution

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

View solution

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

View solution

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?

View solution

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

What is the solution of VÇT?

View solution

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.

View solution

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

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

View solution

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

View solution

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.

View solution