On extended regular expressions (Extended abstract)

In this paper we extend the work of Campeanu, Salomaa and Yu [3] on extended regular expressions featured in the Unix utility egrep and the popular scripting language Perl. We settle the open issue of closure under intersection and provide an improved pumping lemma that will show that a larger class of languages is not recognizable by extended regular expressions