Regular Expressions
Regular Expression is a formal syntactic construct in the theory of formal languages that denotes a regular language over an alphabet, distinguished by its use of a finite combination of concatenation, union, and Kleene star operations to specify patterns of strings recognized by finite automata.
1K
Publications
64.3K
Citations
2.3K
Authors
781
Institutions
Publications per year
2017–2026
189
1K
AUGUSTUS: ab initio prediction of alternative transcripts
Mario Stanke, O. Keller, Irfan Gunduz et al. · Nucleic Acids Research · 2006 · 3K citations · Full text
Introduction to formal language theory
Computer Languages · 1980 · 1.3K citations
Abusive Language Detection in Online User Content
Chikashi Nobata, Joel Tetreault, Achint Thomas et al. · 2016 · 1.1K citations
Derivatives of Regular Expressions
Janusz Brzozowski · Journal of the ACM · 1964 · 931 citations · Full text
1–5 of 1K
2.3K
13
h-index
10
h-index
10
h-index
9
h-index
9
h-index
1–5 of 2.3K
781
Microsoft (United States)
Redmond, United States
20 h-index
59 publications
4.7K citations
University of Pennsylvania
Philadelphia, United States
16 h-index
45 publications
4K citations

University of Waterloo
Waterloo, Canada
15 h-index
37 publications
1.6K citations

Hasselt University
Hasselt, Belgium
14 h-index
26 publications
2.1K citations
Massachusetts Institute of Technology
Cambridge, United States
14 h-index
23 publications
3.1K citations
University of California, Berkeley
Berkeley, United States
13 h-index
27 publications
3.4K citations
Carnegie Mellon University
Pittsburgh, United States
13 h-index
22 publications
738 citations
University of Wisconsin–Madison
Madison, United States
12 h-index
31 publications
2.6K citations
1–8 of 781
43 publications · 2.6K citations
21
h-index
18 publications · 1.2K citations
15
h-index
JACM · 16 publications · 2.2K citations
15
h-index
19 publications · 1.1K citations
15
h-index
16 publications · 663 citations
14
h-index
1–5