Consider the language S where S ab ba Can any word in this-00864
This subjective question is related to the book/course
vu cs507 Information Systems.
It can also be found in
vu cs507 Mid Term Solved Past Paper No. 5.
Question 1: Consider the language S*, where S = {ab, ba}, Can any word in this language contain the substrings aaa or bbb. Why or why not?
Answer:
No words can contain aaa or bbb because every a and b is preceded / followed by a different letter, so one letter can never be surrounded on both sides by the same letter.a and b are the smallest words / strings not in S*.
