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

Authors

2.3K

  1. FN
    Frank Neven

    Hasselt University, Belgium

    13 publications · 1.1K citations

    13

    h-index

  2. BC
    Benjamin C. Pierce

    University of Pennsylvania, United States

    10 publications · 1.2K citations

    10

    h-index

  3. WM
    Wim Martens

    University of Bayreuth, Germany

    10 publications · 513 citations

    10

    h-index

  4. RR
    Rogério Reis

    Universidade do Porto, Portugal

    9 publications · 166 citations

    9

    h-index

  5. MV
    Margus Veanes

    Microsoft (United States), United States

    9 publications · 474 citations

    9

    h-index

1–5 of 2.3K

Venues

  1. Theoretical Computer Science

    43 publications · 2.6K citations

    21

    h-index

  2. ACM SIGPLAN Notices

    18 publications · 1.2K citations

    15

    h-index

  3. Journal of the ACM

    JACM · 16 publications · 2.2K citations

    15

    h-index

  4. Journal of Computer and System Sciences

    19 publications · 1.1K citations

    15

    h-index

  5. Information and Computation

    16 publications · 663 citations

    14

    h-index

1–5