On the intersection of regex languages with regular languages-Reference-Cited by-同舟云学术

On the intersection of regex languages with regular languages

Published:2009-05 Issue:24-25 Volume:410 Page:2336-2344
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Câmpeanu Cezar,Santean Nicolae

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference10 articles.

1. Algorithms for finding patterns in strings;Aho,1990

2. A formal study of practical regular expressions;Câmpeanu;IJFCS,2003

3. C. Câmpeanu, N. Santean, On pattern expression languages, Technical Report CS-2006-20, David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, ON, Canada, 2006

4. Pattern expressions and pattern automata;Câmpeanu;IPL,2004

5. Erzsébet Csuhaj-Varjú, Jürgen Dassow, Jozef Kelemen, Gheorghe Păun, Grammar systems, in: A Grammatical Approach to Distributed and Cooperation, Institute of Mathematics, Gordon and Breach Science Publishers, The Romanian Academy of Sciences, Bucureşti, Romania

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Pumping Lemmas Can be “Harmful”;Theory of Computing Systems;2024-04-05

2. Deducing Matching Strings for Real-World Regular Expressions;Dependable Software Engineering. Theories, Tools, and Applications;2023-12-15

3. On the undecidability and descriptional complexity of synchronized regular expressions;Acta Informatica;2023-04-10

4. Pumping Lemmas Could be 'Harmful';SSRN Electronic Journal;2023

5. Improving a Street-Based Geocoding Algorithm Using Machine Learning Techniques;Applied Sciences;2020-08-13