Google Answers Logo
View Question
Q: CFG with Production Rules ( No Answer,   1 Comment )
Subject: CFG with Production Rules
Category: Computers
Asked by: alienmax-ga
List Price: $10.00
Posted: 25 Oct 2006 17:35 PDT
Expires: 27 Oct 2006 08:17 PDT
Question ID: 776942
I have a language L = L(G) where G is a Context Free Grammar with the
Production Rules: S->aSSS | ab.  I first don't really understand what
strings are generated by the given grammar, so need to figure that
out. I then need to determine if this is a regular language, and if it
is, I need to determine a Finite State Automata that accepts it
(preferably a state diagram if possible.)
There is no answer at this time.

Subject: Re: CFG with Production Rules
From: afrocheese-ga on 26 Oct 2006 23:39 PDT
I kind of figure this is a HW question, but to get you started:
1) What will all strings begin with?
2) What will all strings end with?
3) How many a's can you have in a row?
4) How many b's can you have in a row?

If you answer 1-4, the answer should be apparent.

Important Disclaimer: Answers and comments provided on Google Answers are general information, and are not intended to substitute for informed professional medical, psychiatric, psychological, tax, legal, investment, accounting, or other professional advice. Google does not endorse, and expressly disclaims liability for any product, manufacturer, distributor, service or service provider mentioned or any opinion expressed in answers or comments. Please read carefully the Google Answers Terms of Service.

If you feel that you have found inappropriate content, please let us know by emailing us at with the question ID listed above. Thank you.
Search Google Answers for
Google Answers  

Google Home - Answers FAQ - Terms of Service - Privacy Policy