Inside the Class of regex Languages

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.

[1]  Sheng Yu,et al.  A Formal Study Of Practical Regular Expressions , 2003, Int. J. Found. Comput. Sci..

[2]  Enrico Tronci,et al.  Synchronized regular expressions , 2002, Acta Informatica.

[3]  Lutz M. Wegner,et al.  Languages with Homomorphic Replacements , 1981, Theor. Comput. Sci..

[4]  Jürgen Dassow,et al.  Extending regular expressions with homomorphic replacement , 2010, RAIRO Theor. Informatics Appl..

[5]  Martin Kutrib,et al.  Complexity of multi-head finite automata: Origins and directions , 2011, Theor. Comput. Sci..

[6]  Sheng Yu,et al.  Pattern expressions and pattern automata , 2004, Inf. Process. Lett..