Kleene Star

Kleene Star is a unary operation on sets of strings that, given a formal language, generates the smallest superset containing the empty string and closed under concatenation, thereby producing all finite-length sequences of elements from the original set.

41

Publications

2K

Citations

73

Authors

100

Institutions

Publications per year

2017–2026

4

Authors

73

  1. LA
    Luca Aceto

    Aalborg University, Denmark

    4 publications · 88 citations

    4

    h-index

  2. DK
    Dexter Kozen

    Cornell University, United States

    3 publications · 472 citations

    3

    h-index

  3. MB
    Mikołaj Bojańczyk

    University of Warsaw, Poland

    3 publications · 126 citations

    3

    h-index

  4. YH
    Yo-Sub Han

    Yonsei University, South Korea

    3 publications · 64 citations

    3

    h-index

  5. CJ
    Carolyn Jane Anderson

    Wellesley College, United States

    2 publications · 458 citations

    2

    h-index

1–5 of 73

Venues

  1. Journal of the ACM

    JACM · 3 publications · 54 citations

    3

    h-index

  2. ACM SIGPLAN Notices

    3 publications · 125 citations

    3

    h-index

  3. BRICS Report Series

    2 publications · 37 citations

    2

    h-index

  4. 2

    h-index

  5. Fundamenta Informaticae

    2 publications · 50 citations

    2

    h-index

1–5