adplus-dvertising
frame-decoration

Question

The intersection of context free language and regular language is _________

a.

regular language

b.

context free language

c.

context sensitive language

d.

non of the mentioned

Answer: (b).context free language

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. The intersection of context free language and regular language is _________

Similar Questions

Discover Related MCQs

Q. Which of the following is not a negative property of Context free languages?

Q. Which among the following is a correct option in format for representing symbol and expression in Backus normal form?

Q. Which of the following is true for Valiants algorithm?

Q. The __________ running time of CYK is O(n^3 .|G|)
where n is the length of the parse string and |G| is the size of the context free grammar G.

Q. The standard version of CYK algorithm operates only on context free grammars in the following form:

Q. Which among the following can parse a context free grammar?

Q. Which of the following grammars is similar to Floyd Normal form?

Q. Given a grammar in GNF and a derivable string in the grammar with the length n, any ___________will halt at depth n.

Q. Which of the following can generate Unrestricted grammars?

Q. Every Kuroda Normal form grammar generates ___________

Q. The following format of grammatical notation is accepted by which of the following:
AB->CD

A->BC or

A->B or

A->a

where A, B, C, D are non terminal symbols and a is a terminal symbol.

Q. There is a linear grammar that generates a context free grammar

Q. A___________ is context free grammar with atmost one non terminal in the right handside of the production.

Q. If L1 and L2 are context free languages, L1-L2 are context free:

Q. Which of the following is/are CFL not closed under?

Q. Using the pumping constant n, If there is a string in the language of length between _____ and ____ then the language is infite else not.

Q. If the start symbol is one of those symbols which produce no terminal through any sequence, the CFL is said to be

Q. Which of the following is incorrect?
There exists algorithms to decide if:

Q. Context free languages are not closed under:

Q. Given Grammar G1:
S->aSb

S->e

Grammar G2:

R->cRd

R->e

If L(G)=L(G1) U L(G2), the number of productions the new starting variable would have: