Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Regular expression

Known as: =~, Find and replace, Backreference 
In theoretical computer science and formal language theory, a regular expression (sometimes called a rational expression) is a sequence of characters… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2019
Review
2019
Nowadays, a large amount of information has to be transmitted or processed. This implies high-power processing, large memory… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
Review
2018
Review
2018
In recent years, emotion detection in text has become more popular due to its vast potential applications in marketing, political… Expand
Review
2018
Review
2018
Multi-view data are extensively accessible nowadays thanks to various types of features, different view-points and sensors which… Expand
  • table 1
Review
2017
Review
2017
Even todays most advanced machine learning models are easily fooled by almost imperceptible perturbations of their inputs… Expand
Highly Cited
2001
Highly Cited
2001
This paper presents an efficient method for finding matches to a given regular expression in given text using FPGAs. To match a… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Highly Cited
1999
Highly Cited
1999
An infrared generator wherein an ellipsoidal reflector has a source rich in infra red at one focus thereof. The end of the… Expand
  • table 1
  • figure 1
  • figure 2
  • table 2
  • figure 3
Highly Cited
1968
Highly Cited
1968
A method for locating specific character strings embedded in character text is described and an implementation of this method in… Expand
  • figure 2
  • figure 4
  • figure 5
Highly Cited
1968
Highly Cited
1968
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
Kleene's regular expressions, which can be used for describing sequential circuits, were defined using three operators (union… Expand
  • figure 3
  • figure 4
Highly Cited
1960
Highly Cited
1960
Algorithms are presented for 1) converting a state graph describing the behavior of an automaton to a regular expression… Expand