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
Parents
261
Learning regular sets from queries and counterexamples
Dana Angluin · Information and Computation · 1987 · 2.1K citations
Ashok K. Chandra, Dexter Kozen, Larry J. Stockmeyer · Journal of the ACM · 1981 · 1.2K citations · Full text
On extreme points of regular convex sets
D. Milman · Studia Mathematica · 1940 · 328 citations · Full text
1–5 of 261
389
6
h-index
4
h-index
4
h-index
4
h-index
3
h-index
1–5 of 389
241

University of Waterloo
Waterloo, Canada
8 h-index
11 publications
507 citations

Centre National de la Recherche Scientifique
Paris, France
6 h-index
7 publications
351 citations

Université de Montpellier
Montpellier, France
6 h-index
9 publications
402 citations
Princeton University
Princeton, United States
5 h-index
7 publications
624 citations
University of California, Berkeley
Berkeley, United States
5 h-index
6 publications
117 citations
Université Paris Cité
Paris, France
5 h-index
7 publications
333 citations

University of Szeged
Szeged, Hungary
4 h-index
5 publications
137 citations

University of Helsinki
Helsinki, Finland
4 h-index
4 publications
269 citations
1–8 of 241
13 publications · 552 citations
12
h-index
TRAN · 12 publications · 780 citations
11
h-index
7 publications · 2.8K citations
7
h-index
6 publications · 254 citations
6
h-index
PROC · 6 publications · 212 citations
6
h-index
1–5