Regular Sets

Regular Sets is a formal language class consisting of sets of strings over an alphabet that can be constructed from finite sets using the operations of union, concatenation, and Kleene star, thereby defining the language class accepted by finite automata.

261

Publications

14.2K

Citations

389

Authors

241

Institutions

Publications per year

2017–2026

18

Authors

389

  1. LT
    Lionel Thibault

    Université de Montpellier, France

    6 publications · 318 citations

    6

    h-index

  2. SL
    Stephen L. Bloom

    Stevens Institute of Technology, United States

    4 publications · 126 citations

    4

    h-index

  3. SG
    Seymour Ginsburg

    University of Southern California, United States

    4 publications · 135 citations

    4

    h-index

  4. ZÉ
    Zoltán Ésik

    University of Szeged, Hungary

    4 publications · 126 citations

    4

    h-index

  5. RC
    Rina Cohen

    University of Waterloo, Canada

    3 publications · 52 citations

    3

    h-index

1–5 of 389

Venues

  1. Theoretical Computer Science

    13 publications · 552 citations

    12

    h-index

  2. Transactions of the American Mathematical Society

    TRAN · 12 publications · 780 citations

    11

    h-index

  3. Information and Computation

    7 publications · 2.8K citations

    7

    h-index

  4. Journal of Symbolic Logic

    6 publications · 254 citations

    6

    h-index

  5. Proceedings of the American Mathematical Society

    PROC · 6 publications · 212 citations

    6

    h-index

1–5