adplus-dvertising
frame-decoration

Question

The context free grammar S → A111|S1, A → A0 | 00 is equivalent to

a.

{0ⁿ1ᵐ | n=2, m=3}

b.

{0ⁿ1ᵐ | n=1, m=5}

c.

{0ⁿ1ᵐ | n should be greater than two and m should be greater than four}

d.

None of the mentioned

Posted under Formal Languages and Automata Theory

Answer: (a).{0ⁿ1ᵐ | n=2, m=3}

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 → A111|S1, A → A0 | 00 is equivalent to
Add Comment

Similar Questions

Discover Related MCQs

Q. The context free grammar S → SS | 0S1 | 1S0 | ɛ generates

View solution

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
View All MCQs on Formal Languages and Automata Theory

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!

C Programming

Master one of the most widely used programming languages with our C Programming MCQs....

Internet of Things (IoT)

Discover how devices communicate with each other in the smart world with our IoT...

Software Architecture and Design

Get a strong hold on the blueprint of software systems with our Software Architecture...

Formal Languages and Automata Theory

Discover the mathematical models of computation with our Formal Languages and...

Data Warehousing and OLAP

Strengthen your knowledge of Data Warehousing and OLAP with our specialized MCQs....

Big Data Computing

Enhance your understanding of Big Data Computing with our comprehensive MCQs. Explore...

JavaScript

Strengthen your web development skills with our JavaScript MCQs. Understand core...

Web Technologies

Master the building blocks of the web with our Web Technologies MCQs. From HTML and...

CSS

Polish your web design skills with our CSS MCQs. Learn about selectors, properties,...