Regular Grammar
Regular Grammar is a type of formal grammar that generates exactly the class of regular languages, characterized by production rules restricted to the forms $ A \rightarrow a $ or $ A \rightarrow aB $, where $ A $ and $ B $ are non-terminal symbols and $ a $ is a terminal symbol.
173
Publications
8.6K
Citations
337
Authors
176
Institutions
Publications per year
2017–2026
17
Parents
173
Regular models of phonological rule systems
Ronald M. Kaplan, Martin Kay · 1994 · 816 citations
Precise analysis of string expressions
2003 · 400 citations
Computing, Computer Science, Natural Language Processing +14
Chemical Name to Structure: OPSIN, an Open Source Solution
Daniel M. Lowe, Peter Corbett, Peter Murray‐Rust et al. · Journal of Chemical Information and Modeling · 2011 · 245 citations
State Complexity of Regular Languages
1–5 of 173
337
4
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 337
176

University of Waterloo
Waterloo, Canada
7 h-index
16 publications
1.2K citations
Princeton University
Princeton, United States
6 h-index
8 publications
410 citations
University of Maryland, College Park
College Park, United States
5 h-index
5 publications
165 citations
University of Illinois Urbana-Champaign
Urbana, United States
5 h-index
7 publications
332 citations

Centre National de la Recherche Scientifique
Paris, France
4 h-index
4 publications
134 citations
University of Pennsylvania
Philadelphia, United States
3 h-index
4 publications
231 citations
University of California, Santa Cruz
Santa Cruz, United States
3 h-index
4 publications
421 citations

University of Warsaw
Warsaw, Poland
3 h-index
6 publications
99 citations
1–8 of 176
12 publications · 973 citations
12
h-index
6 publications · 413 citations
6
h-index
5 publications · 222 citations
5
h-index
5 publications · 164 citations
5
h-index
4 publications · 141 citations
4
h-index
1–5