On Extended Regular Expressions

  • Benjamin Carle
  • Paliath Narendran
Conference paper

DOI: 10.1007/978-3-642-00982-2_24

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5457)
Cite this paper as:
Carle B., Narendran P. (2009) On Extended Regular Expressions. In: Dediu A.H., Ionescu A.M., Martín-Vide C. (eds) Language and Automata Theory and Applications. LATA 2009. Lecture Notes in Computer Science, vol 5457. Springer, Berlin, Heidelberg

Abstract

In this paper we extend the work of Campeanu, Salomaa and Yu [1] 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. We also investigate some questions regarding extended multi-pattern languages introduced by Nagy in [2].

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Benjamin Carle
    • 1
  • Paliath Narendran
    • 1
  1. 1.Dept. of Computer ScienceUniversity at Albany–SUNYAlbanyUSA

Personalised recommendations