Note
Regular expression for a language without empty word

https://doi.org/10.1016/0304-3975(96)00028-XGet rights and content
Under an Elsevier user license
open archive

Abstract

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 ¦E-¦ ⩽ ¦E¦ + 12 log (¦E¦ + 1) + ¦E¦ - 12, where ¦E¦ is the size of E, and ¦E-¦ is the size of E-.

Cited by (0)