Generalized star-height problem

Can all regular languages be expressed using generalized regular expressions with a limited nesting depth of Kleene stars?

Open the “Other problems” section on Wikipedia →

Source: List of unsolved problems in computer science (CC BY-SA 4.0)