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
Parents
41
Carolyn Jane Anderson, Nate Foster, Arjun Guha et al. · 2014 · 374 citations
Grammars with macro-like productions
Michael J. Fischer · 1968 · 208 citations
Computing, Computer Science, Natural Language Processing +15
Aaron Bohannon, J. Nathan Foster, Benjamin C. Pierce et al. · 2008 · 181 citations
Carolyn Jane Anderson, Nate Foster, Arjun Guha et al. · ACM SIGPLAN Notices · 2014 · 84 citations · Full text
1–5 of 41
73
4
h-index
3
h-index
3
h-index
3
h-index
2
h-index
1–5 of 73
100
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
6 h-index
6 publications
305 citations

École Normale Supérieure Paris-Saclay
Gif-sur-Yvette, France
3 h-index
3 publications
73 citations

Centre National de la Recherche Scientifique
Paris, France
3 h-index
4 publications
248 citations

Cornell University
Ithaca, United States
3 h-index
6 publications
944 citations
Aalborg University
Aalborg, Denmark
3 h-index
5 publications
121 citations
Carnegie Mellon University
Pittsburgh, United States
3 h-index
4 publications
534 citations
The University of Tokyo
Tokyo, Japan
2 h-index
3 publications
48 citations

Vrije Universiteit Amsterdam
Amsterdam, The Netherlands
2 h-index
2 publications
46 citations
1–8 of 100
JACM · 3 publications · 54 citations
3
h-index
3 publications · 125 citations
3
h-index
2 publications · 37 citations
2
h-index
2 publications · 23 citations
2
h-index
2 publications · 50 citations
2
h-index
1–5