On Extended Regular Expressions

Authors:
Benjamin Carle;Paliath Narendran
Affiliations:
Dept. of Computer Science, University at Albany---SUNY, Albany, NY 12222;Dept. of Computer Science, University at Albany---SUNY, Albany, NY 12222
Venue:
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Year:
2009

Citing 7
Cited 2

Logic for computer science: foundations of automatic theorem proving

Logic for computer science: foundations of automatic theorem proving
Algorithms for finding patterns in strings

Handbook of theoretical computer science (vol. A)
Multi-pattern languages

Theoretical Computer Science
Decision problems for patterns

Journal of Computer and System Sciences
Regular Closure of Deterministic Languages

SIAM Journal on Computing
Finite turns and the regular closure of linear context-free languages

Discrete Applied Mathematics
On the language equivalence of NE star-patterns

Information Processing Letters

Inside the class of REGEX languages

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Spanners: a formal framework for information extraction

Proceedings of the 32nd symposium on Principles of database systems

Quantified Score

Hi-index	0.00

Visualization

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