Question
theory of computing

Design a grammar for L-(an b2n C3m , n > 0 } .
0 0
Add a comment Improve this question Transcribed image text
Answer #1

Grammar

S -> aYSccc | aYccc

Ya -> aY

Yc -> bbc

Yb -> bbb

Explanation

For each a, there are 2 b's and 3 c's

Add a comment
Answer #2

Grammar

S -> aYSccc | aYccc

Ya -> aY

Yc -> bbc

Yb -> bbb

Explanation

For each a, there are 2 b's and 3 c's


answered by: ANURANJAN SARSAM
Add a comment
Know the answer?
Add Answer to:
theory of computing Design a grammar for L-(an b2n C3m , n > 0 } .
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT