Regular Languages
Regular Languages is the class of formal languages that can be recognized by some finite automaton, equivalently generated by a regular grammar or described by a regular expression, over a given alphabet.
1.5K
Publications
93.7K
Citations
2K
Authors
749
Institutions
Publications per year
2017–2026
105
1.5K
Introduction to automata theory, languages, and computation
Computer Languages · 1980 · 6.9K citations
Learning regular sets from queries and counterexamples
Dana Angluin · Information and Computation · 1987 · 2.1K citations
On certain formal properties of grammars
Noam Chomsky · Information and Control · 1959 · 1.6K citations
1–5 of 1.5K
2K
14
h-index
13
h-index
13
h-index
12
h-index
11
h-index
1–5 of 2K
749

Centre National de la Recherche Scientifique
Paris, France
22 h-index
78 publications
2.4K citations

University of Waterloo
Waterloo, Canada
21 h-index
62 publications
2.6K citations
Université Paris Cité
Paris, France
20 h-index
56 publications
1.5K citations

Western University
London, Canada
19 h-index
47 publications
2.2K citations
Princeton University
Princeton, United States
18 h-index
33 publications
3.4K citations

University of Milan
Milan, Italy
16 h-index
35 publications
1.2K citations
Laboratoire d'Informatique Algorithmique: Fondements et Applications
Paris, France
16 h-index
27 publications
999 citations
University of Colorado Boulder
Boulder, United States
15 h-index
20 publications
726 citations
1–8 of 749
171 publications · 7K citations
42
h-index
57 publications · 3.6K citations
32
h-index
51 publications · 3.9K citations
26
h-index
31 publications · 1.7K citations
25
h-index
43 publications · 4.2K citations
25
h-index
1–5