Question
a.
Equal number of 0’s and 1’s
b.
Unequal number of 0’s and 1’s
c.
Number of 0’s followed by any number of 1’s
d.
None of the mentioned
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. The context free grammar S → SS | 0S1 | 1S0 | ɛ generates
Similar Questions
Discover Related MCQs
Q. Which of the following statement is false?
View solution
Q. Push down automata accepts which language
View solution
Q. A regular Grammar is a
View solution
Q. A CFG is closed under
View solution
Q. Which of these does not belong to CFG ?
View solution
Q. A language is regular if and only if
View solution
Q. Regular grammar is
View solution
Q. Give a production grammar that specified language L = {a^i b^2i >= 1}
View solution
Q. The production Grammar {S->aSbb, S->abb} is
View solution
Q. S → SS S → λ S → aSb S → bSa which type of grammar is it?
View solution
Q. S → abS S → a is which grammar ?
View solution
Q. What are the two types of Linear Grammar?
View solution
Q. Which Type of Grammar is it?
S → Aa A → Aab | λ
View solution
Q. Which of the following is the most general phase structured grammar
View solution
Q. Which of the following grammars are not phase structured ?
View solution
Q. CSG can be recognized by
View solution
Q. Which of the following is/are the suitable approaches for inferencing?
View solution
Q. If w belongs to L(G), for some CFG, then w has a parse tree, which defines the syntactic structure of w. w could be:
View solution
Q. Which of the following does the given parse tree correspond to?
View solution
Q. The entity which generate Language is termed as:
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Formal Languages and Automata Theory? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
