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

Authors

337

  1. CW
    Christian W. Omlin

    Princeton University, United States

    4 publications · 251 citations

    4

    h-index

  2. CL
    C. Lee Giles

    Pennsylvania State University, United States

    4 publications · 251 citations

    4

    h-index

  3. LP
    Leonard Pitt

    University of Illinois Urbana-Champaign, United States

    3 publications · 265 citations

    3

    h-index

  4. JS
    Jeffrey Shallit

    University of Waterloo, Canada

    3 publications · 175 citations

    3

    h-index

  5. KS
    Kai Salomaa

    Queen's University, Canada

    3 publications · 373 citations

    3

    h-index

1–5 of 337

Venues

  1. Theoretical Computer Science

    12 publications · 973 citations

    12

    h-index

  2. Journal of Computer and System Sciences

    6 publications · 413 citations

    6

    h-index

  3. SIAM Journal on Computing

    5 publications · 222 citations

    5

    h-index

  4. Information and Computation

    5 publications · 164 citations

    5

    h-index

  5. 4

    h-index

1–5