Exhibit languages A and B such that neither is a subset of the other, but the kleene star of A=the Kleene star of B. How does that works?

Any help will be appreciated.

Printable View

- Sep 18th 2009, 11:49 AMpeng783Kleene star 2
Exhibit languages A and B such that neither is a subset of the other, but the kleene star of A=the Kleene star of B. How does that works?

Any help will be appreciated. - Sep 18th 2009, 02:40 PMproxximus
Hint:

There is an example with A and B languages over the singleton alphabet {|}, and |A|=|B|=2.

---

proxximus - Sep 19th 2009, 02:09 PMpeng783
A={empty string, a , b} and B={a, b , ab}

Are those two statisfy that A and B are neither is a subset of the other, but A star = B star?

What is singleton aplhabet?