Generalized star height problem

can all regular languages be expressed using generalized regular expressions with limited nesting depths of Kleene stars?

Open the “Model theory and formal languages” section on Wikipedia →

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