Skip to main content
SpringerLink
Log in

Inside the Class of REGEX Languages

  • Conference paper
Developments in Language Theory (DLT 2012)

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

Included in the following conference series:

Abstract

We study different possibilities of combining the concept of homomorphic replacement with regular expressions in order to investigate the class of languages given by extended regular expressions with backreferences (REGEX). It is shown in which regard existing and natural ways to do this fail to reach the expressive power of REGEX. Furthermore, the complexity of the membership problem for REGEX with a bounded number of backreferences is considered.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A.: Algorithms for finding patterns in strings. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Algorithms and Complexity, vol. A, pp. 255–300. MIT Press (1990)

    Google Scholar 

  2. Albert, J., Wegner, L.: Languages with homomorphic replacements. Theoretical Computer Science 16, 291–305 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  3. Angluin, D.: Finding patterns common to a set of strings. In: Proc. 11th Annual ACM Symposium on Theory of Computing, pp. 130–141 (1979)

    Google Scholar 

  4. Bordihn, H., Dassow, J., Holzer, M.: Extending regular expressions with homomorphic replacement. RAIRO Theoretical Informatics and Applications 44, 229–255 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  5. Câmpeanu, C., Salomaa, K., Yu, S.: A formal study of practical regular expressions. International Journal of Foundations of Computer Science 14, 1007–1018 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  6. Câmpeanu, C., Santean, N.: On the intersection of regex languages with regular languages. Theoretical Computer Science 410, 2336–2344 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  7. Câmpeanu, C., Yu, S.: Pattern expressions and pattern automata. Information Processing Letters 92, 267–274 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  8. Carle, B., Narendran, P.: On Extended Regular Expressions. In: Dediu, A.H., Ionescu, A.M., Martín-Vide, C. (eds.) LATA 2009. LNCS, vol. 5457, pp. 279–289. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  9. Freydenberger, D.D.: Extended regular expressions: Succinctness and decidability. In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011. LIPIcs, vol. 9, pp. 507–518 (2011)

    Google Scholar 

  10. Friedl, J.E.F.: Mastering Regular Expressions, 3rd edn. O’Reilly, Sebastopol (2006)

    Google Scholar 

  11. Holzer, M., Kutrib, M., Malcher, A.: Complexity of multi-head finite automata: Origins and directions. Theoretical Computer Science 412, 83–96 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kari, L., Rozenberg, G., Salomaa, A.: L systems. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, ch. 5, pp. 253–328. Springer (1997)

    Google Scholar 

  13. Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Shannon, C.E., McCarthy, J. (eds.) Automata Studies. Annals of Mathematics Studies, vol. 34, pp. 3–41. Princeton University Press (1956)

    Google Scholar 

  14. Larsen, K.S.: Regular expressions with nested levels of back referencing form a hierarchy. Information Processing Letters 65, 169–172 (1998)

    Article  MathSciNet  Google Scholar 

  15. Della Penna, G., Intrigila, B., Tronci, E., Venturini Zilli, M.: Synchronized regular expressions. Acta Informatica 39, 31–70 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  16. Shinohara, T.: Polynomial Time Inference of Extended Regular Pattern Languages. In: Goto, E., Furukawa, K., Nakajima, R., Nakata, I., Yonezawa, A. (eds.) RIMS 1982. LNCS, vol. 147, pp. 115–127. Springer, Heidelberg (1983)

    Chapter  Google Scholar 

  17. Thompson, K.: Programming techniques: Regular expression search algorithm. Communications of the ACM 11 (1968)

    Google Scholar 

  18. Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, ch. 2, pp. 41–110. Springer (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Loughborough University, Loughborough, Leicestershire, LE11 3TU, United Kingdom

    Markus L. Schmid

Authors
  1. Markus L. Schmid
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Deptartment of Electrical Engineering, National Taiwan University, 106, Taipei, Taiwan

    Hsu-Chun Yen

  2. Department of Computer Science, University of California, 93106, Santa Barbara, CA, USA

    Oscar H. Ibarra

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schmid, M.L. (2012). Inside the Class of REGEX Languages. In: Yen, HC., Ibarra, O.H. (eds) Developments in Language Theory. DLT 2012. Lecture Notes in Computer Science, vol 7410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31653-1_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31653-1_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31652-4

  • Online ISBN: 978-3-642-31653-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation