Jump to content

Computer theory: Kleene closure


annitaz

Recommended Posts

Which one of the following is an example of two sets S and T of strings such that S ⊄ T and T ⊄ S, but S* = T*?

 

1. S = {a, b, abb, bba} and T = {a, b, bba}

2. S = {a, aaaa} and T = {a, aaa, aaaa}

3. S = {a, ab, aab} and T = {a, ab, abab}

4. S = {a, b, aaa} and T = {a, bbb}

5. S = {bb, bbbb} and T = {b}

 

I have excluded answers 1,2,5 but I am stuck with 3 and 4. When is S* equal to T*?

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.