In [1] A. Brüggemann-Klein asks the following question: “Is there a linear-time algorithm transforming a regular expression E into an expression E- with oliver In this paper we give a recursive definition of E- which enables us to provide such an algorithm. Furthermore, we show that , where is the size of E, and is the size of E-.