adplus-dvertising
frame-decoration

Question

Give a production grammar for the language L = {x/x ∈ (a,b)*, the number of a’s in x is multiple of 3}.

a.

{S->bS, S->b,S->aA, S->bA, A->aB, B->bB, B->aS, S->a}

b.

{S->aS,S->bA,A->bB,B->bBa,B->bB}

c.

{S->aaS,S->bbA,A->bB,B->ba}

d.

None of the above

Posted under Formal Languages and Automata Theory

Answer: (a).{S->bS, S->b,S->aA, S->bA, A->aB, B->bB, B->aS, S->a}

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Give a production grammar for the language L = {x/x ∈ (a,b)*, the number of a’s in x is multiple of 3}.
Add Comment

Similar Questions

Discover Related MCQs

Q. CFG is

View solution

Q. The idea of an automation with a stack as auxiliary storage

View solution

Q. Transition of finite automata is

View solution

Q. A context free language is called ambiguous if

View solution

Q. Which of the following identity is wrong?

View solution

Q. Finite automata has

View solution

Q. Finite automation and FSMS are used for

View solution

Q. In computer, finite automata program can be stored using

View solution

Q. A FA can be used for

View solution

Q. The palindromes can’t be recognized by a FA because

View solution

Q. Two – way finite automata has

View solution

Q. A FA with deterministic transitions capability is known as

View solution

Q. Limitation of a FA is

View solution

Q. How many DFA’s exist with three states over the input alphabet {0,1}?

View solution

Q. A FA with non – deterministic transitions capability is known as

View solution

Q. The behaviour of a NFA can be simulated by a DFA

View solution

Q. A NFA can be enhanced to move to a next state without reading the input tape.

View solution

Q. A FA having more than one reading head has

View solution

Q. The palindrome unit can not be recognized by a FA because

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!

HTML

Start your journey in web development with our HTML MCQs. Learn the building blocks...

Compiler Design

Unravel the process of translating source code into executable programs with our...

R Programming

Unleash the power of statistical computing with our R Programming MCQs. Topics cover...

CSS

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

SQL Server

Master Microsoft's database server with our SQL Server MCQs. Topics cover database...

Java Programming

Level up your coding skills with our Java Programming MCQs. From object-oriented...

Big Data Computing

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

Reverse Engineering

Strengthen your understanding of Reverse Engineering with our curated set of MCQs....

Embedded Systems

Dive into the world of specialized computing systems with our Embedded Systems MCQs....