Advertisement

Characterising REGEX Languages by Regular Languages Equipped with Factor-Referencing

  • Markus L. Schmid
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8633)

Abstract

A (factor-)reference in a word is a special symbol that refers to another factor in the same word; a reference is dereferenced by substituting it with the referenced factor. We introduce and investigate the class ref-REG of all languages that can be obtained by taking a regular language R and then dereferencing all possible references in the words of R. We show that ref-REG coincides with the class of languages defined by regular expressions as they exist in modern programming languages like Perl, Python, Java, etc. (often called REGEX languages).

Keywords

REGEX languages regular languages memory automata 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Albert, J., Wegner, L.: Languages with homomorphic replacements. Theoretical Computer Science 16, 291–305 (1981)CrossRefMATHMathSciNetGoogle Scholar
  2. 2.
    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
  3. 3.
    Bordihn, H., Dassow, J., Holzer, M.: Extending regular expressions with homomorphic replacement. RAIRO Theoretical Informatics and Applications 44, 229–255 (2010)CrossRefMATHMathSciNetGoogle Scholar
  4. 4.
    Câmpeanu, C., Salomaa, K., Yu, S.: A formal study of practical regular expressions. Int. Journal of Foundations of Computer Science 14, 1007–1018 (2003)CrossRefMATHGoogle Scholar
  5. 5.
    Câmpeanu, C., Santean, N.: On the intersection of regex languages with regular languages. Theoretical Computer Science 410, 2336–2344 (2009)CrossRefMATHMathSciNetGoogle Scholar
  6. 6.
    Câmpeanu, C., Yu, S.: Pattern expressions and pattern automata. Information Processing Letters 92, 267–274 (2004)CrossRefMATHMathSciNetGoogle Scholar
  7. 7.
    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)CrossRefGoogle Scholar
  8. 8.
    Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer, Berlin (1989)CrossRefGoogle Scholar
  9. 9.
    Dassow, J., Păun, G., Salomaa, A.: Grammars with controlled derivations. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 2, pp. 101–154. Springer (1997)Google Scholar
  10. 10.
    Floyd, R.W.: On the nonexistence of a phrase structure grammar for algol 60. Communications of the ACM 5, 483–484 (1962)CrossRefMATHGoogle Scholar
  11. 11.
    Freydenberger, D.D.: Extended regular expressions: Succinctness and decidability. Theory of Computing Systems 53, 159–193 (2013)CrossRefMATHMathSciNetGoogle Scholar
  12. 12.
    Friedl, J.E.F.: Mastering Regular Expressions, 3rd edn. O’Reilly, Sebastopol (2006)Google Scholar
  13. 13.
    Kallmeyer, L.: Parsing Beyond Context-Free Grammars. Springer (2010)Google Scholar
  14. 14.
    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
  15. 15.
    Penna, G.D., Intrigila, B., Tronci, E., Zilli, M.V.: Synchronized regular expressions. Acta Informatica 39, 31–70 (2003)CrossRefMATHMathSciNetGoogle Scholar
  16. 16.
    Schmid, M.L.: Inside the class of regex languages. International Journal of Foundations of Computer Science 24, 1117–1134 (2013)CrossRefMATHMathSciNetGoogle Scholar
  17. 17.
    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

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Markus L. Schmid
    • 1
  1. 1.FB IV–Abteilung InformatikwissenschaftenUniversität TrierTrierGermany

Personalised recommendations