Jump to content

Context free Grammar


Binx

Recommended Posts

im trying to create a context free grammar over the language

 

L = {a, b}

 

where b is never trippled

 

Here is what I have so far

S-> X | Y

X-> bbXY | aX | aY | bb

Y-> b | lamda

 

lamda being the empty letter

 

I'm wondering if this is an acceptable solution, I guess im also not sure if b never being trippled means it also cannot be quadrupled which would make the problem easier I suppose.

Link to comment
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
×
×
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.