Inside the class of REGEX languages

Authors:
Markus L. Schmid
Affiliations:
Department of Computer Science, Loughborough University, Loughborough, Leicestershire, United Kingdom
Venue:
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Year:
2012

Citing 12
Cited 0

Algorithms for finding patterns in strings

Handbook of theoretical computer science (vol. A)
Regular languages

Handbook of formal languages, vol. 1
L systems

Handbook of formal languages, vol. 1
Regular expressions with nested levels of back referencing form a hierarchy

Information Processing Letters
Programming Techniques: Regular expression search algorithm

Communications of the ACM
Polynomial Time Inference of Extended Regular Pattern Languages

Proceedings of RIMS Symposium on Software Science and Engineering
Finding patterns common to a set of strings (Extended Abstract)

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Mastering Regular Expressions

Mastering Regular Expressions
On Extended Regular Expressions

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
On the intersection of regex languages with regular languages

Theoretical Computer Science
Pattern expressions and pattern automata

Information Processing Letters
Complexity of multi-head finite automata: Origins and directions

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.