Regular Expression Matching

Regular Expression Matching is a computational method in string algorithms that determines whether a given string conforms to a pattern specified by a regular expression, distinguishing it from other pattern-matching techniques through its foundation in formal language theory and finite automata.

291

Publications

15.7K

Citations

742

Authors

292

Institutions

Publications per year

2017–2026

49

Authors

742

  1. MB
    Michela Becchi

    University of Missouri, United States

    13 publications · 1.1K citations

    13

    h-index

  2. PC
    Patrick Crowley

    Washington University in St. Louis, United States

    8 publications · 1.5K citations

    8

    h-index

  3. AX
    Alex X. Liu

    Michigan State University, United States

    8 publications · 230 citations

    8

    h-index

  4. MD
    Marco D. Santambrogio

    Politecnico di Milano, Italy

    6 publications · 116 citations

    6

    h-index

  5. ET
    Eric Torng

    Michigan State University, United States

    5 publications · 181 citations

    5

    h-index

1–5 of 742

Venues

  1. Proceedings of the ACM on Programming Languages

    PACMPL · 5 publications · 125 citations

    5

    h-index

  2. Software Practice and Experience

    5 publications · 339 citations

    5

    h-index

  3. Electronic Notes in Theoretical Computer Science

    ENTCS · 4 publications · 148 citations

    4

    h-index

  4. Journal of Functional Programming

    4 publications · 159 citations

    4

    h-index

  5. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 4 publications · 291 citations

    4

    h-index

1–5