Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,275,344 papers from all fields of science
Search
Sign In
Create Free Account
Regular expression
Known as:
=~
, Find and replace
, Backreference
Expand
In theoretical computer science and formal language theory, a regular expression (sometimes called a rational expression) is a sequence of characters…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Brzozowski derivative
C standard library
C++ Technical Report 1
Caret
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
Algorithms to accelerate multiple regular expressions matching for deep packet inspection
S. Sushanth Kumar
,
Sarang Dharmapurikar
,
Fang Yu
,
P. Crowley
,
J. Turner
Conference on Applications, Technologies…
2006
Corpus ID: 2054973
There is a growing demand for network devices capable of examining the content of data packets in order to improve network…
Expand
Highly Cited
2006
Highly Cited
2006
Fast and memory-efficient regular expression matching for deep packet inspection
Fang Yu
,
Z. Chen
,
Y. Diao
,
T. V. Lakshman
,
R. Katz
Symposium on Architecture For Networking And…
2006
Corpus ID: 3449616
Packet content scanning at high speed has become extremely important due to its applications in network security, network…
Expand
Highly Cited
2001
Highly Cited
2001
Fast Regular Expression Matching Using FPGAs
Reetinder P. S. Sidhu
,
V. Prasanna
IEEE Symposium on Field-Programmable Custom…
2001
Corpus ID: 2759005
This paper presents an efficient method for finding matches to a given regular expression in given text using FPGAs. To match a…
Expand
Review
1997
Review
1997
Mastering Regular Expressions
Jeffrey E. F. Friedl
1997
Corpus ID: 60783722
Regular expressions are an extremely powerful tool for manipulating text and data. They are now standard features in a wide range…
Expand
Highly Cited
1994
Highly Cited
1994
Algorithms for quantum computation: discrete logarithms and factoring
P. Shor
Proceedings 35th Annual Symposium on Foundations…
1994
Corpus ID: 15291489
A computer is generally considered to be a universal computational device; i.e., it is believed able to simulate any physical…
Expand
Highly Cited
1989
Highly Cited
1989
Quantum field theory and the Jones polynomial
Edward Witten
1989
Corpus ID: 14951363
It is shown that 2+1 dimensional quantum Yang-Mills theory, with an action consisting purely of the Chern-Simons term, is exactly…
Expand
Highly Cited
1968
Highly Cited
1968
Programming Techniques: Regular expression search algorithm
K. Thompson
Communications of the ACM
1968
Corpus ID: 21260384
A method for locating specific character strings embedded in character text is described and an implementation of this method in…
Expand
Highly Cited
1964
Highly Cited
1964
Derivatives of Regular Expressions
J. Brzozowski
JACM
1964
Corpus ID: 14126942
Kleene's regular expressions, which can be used for describing sequential circuits, were defined using three operators (union…
Expand
Highly Cited
1960
Highly Cited
1960
Regular Expressions and State Graphs for Automata
R. McNaughton
,
H. Yamada
IRE Transactions on Electronic Computers
1960
Corpus ID: 42395383
Algorithms are presented for 1) converting a state graph describing the behavior of an automaton to a regular expression…
Expand
Highly Cited
1959
Highly Cited
1959
A note on two problems in connexion with graphs
E. Dijkstra
Numerische Mathematik
1959
Corpus ID: 123284777
We consider n points (nodes), some or all pairs of which are connected by a branch; the length of each branch is given. We…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE