Skip to main content
Springer Nature Link
Log in

On Extended Regular Expressions

  • Conference paper
Language and Automata Theory and Applications (LATA 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5457))

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].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Câmpeanu, C., Salomaa, K., Yu, S.: A formal study of practical regular expressions. Int. J. Found. Comput. Sci. 14, 1007–1018 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  2. Nagy, B.: On the language equivalence of NE star-patterns. Inf. Process. Lett. 95, 396–400 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  3. Kari, L., Mateescu, A., Paun, G., Salomaa, A.: Multi-pattern languages. Theor. Comput. Sci. 141, 253–268 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  4. Aho, A.V.: Algorithms for finding patterns in strings. In: Handbook of Theoretical Computer Science. Algorithms and Complexity (A), vol. A, pp. 255–300. MIT Press, Cambridge (1990)

    Google Scholar 

  5. Gallier, J.H.: Logic for Computer Science: Foundations of Automatic Theorem Proving. Harper & Row (1986)

    Google Scholar 

  6. Dumitrescu, S., Păun, G., Salomaa, A.: Languages associated to finite and infinite patterns. Rev. Roum. Math. Pures Appl. 41, 607–625 (1996)

    MathSciNet  Google Scholar 

  7. Bertsch, E., Nederhof, M.J.: Regular closure of deterministic languages. SIAM J. Comput. 29, 81–102 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  8. Kutrib, M., Malcher, A.: Finite turns and the regular closure of linear context-free languages. Discrete Applied Mathematics 155, 2152–2164 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  9. Jiang, T., Salomaa, A., Salomaa, K., Yu, S.: Decision problems for patterns. J. Comput. Syst. Sci. 50, 53–63 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  10. Nagy, B.: A normal form for regular expressions. In: Eighth International Conference on Developments in Language Theory (DLT 2004), Auckland, New Zealand (2004), www.cs.auckland.ac.nz/CDMTCS/researchreports/252dlt04.pdf

  11. Carle, B., Narendran, P., Scheriff, C.: On extended regular expressions. In: Twenty-first International Workshop on Unification (UNIF 2007), Paris, France (June 2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, University at Albany–SUNY, Albany, NY 12222, USA

    Benjamin Carle & Paliath Narendran

Authors
  1. Benjamin Carle
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paliath Narendran
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Linguistics, Rovira i Virgili University, Av. Catalunya, 35, 43002, Tarragona, Spain

    Adrian Horia Dediu

  2. Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Tarragona, Spain

    Armand Mihai Ionescu

  3. European Research Council Executive Agency, 16 Place Rogier, 1210, Brussels, Belgium

    Carlos Martín-Vide

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

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. https://doi.org/10.1007/978-3-642-00982-2_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-00982-2_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00981-5

  • Online ISBN: 978-3-642-00982-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics