If A and B are star-free languages, then we know that at least the following languages are star-free (Mc-Naughton and Papert, 1971): It is also possible that the language of a regular expression is star-free although the expression contains the Kleene star operator.
the method based on the properties of the syntactic monoid of the language is important.