Computer Science, asked by sami855555555, 3 months ago

Consider the language S*, where S= { ab , ba }, Can any word in this language
contain the substrings aaa or bbb? Why or why not?
II: Let P= { ab, bb } and let Q= { ab, bb, bbbb } show that P*=Q*.

Answers

Answered by Itzabhi001
2

Explanation:

Consider the language S*, where S= { ab , ba }, Can any word in this language

contain the substrings aaa or bbb? Why or why not?

II: Let P= { ab, bb } and let Q= { ab, bb, bbbb } show that P*=Q*.

Similar questions