L-system Grammar

L-System Grammar is a formal rewriting system belonging to the class of parallel string-rewriting grammars, distinguished by its deterministic, context-free production rules that iteratively generate complex, self-similar structures through simultaneous symbol substitution.

21

Publications

1.8K

Citations

40

Authors

25

Institutions

Publications per year

2017–2026

1

Variants

Lindenmayer System Grammar

Authors

40

  1. PP
    Przemysław Prusinkiewicz

    University of Calgary, Canada

    2 publications · 128 citations

    2

    h-index

  2. JM
    Jon McCormack

    Monash University, Australia

    2 publications · 149 citations

    2

    h-index

  3. YH
    Yu‐Chi Huang

    Kaohsiung Chang Gung Memorial Hospital, Taiwan

    1 publications · 26 citations

    1

    h-index

  4. VJ
    Vivian J. Cook

    University of Essex, United Kingdom

    1 publications · 138 citations

    1

    h-index

  5. RK
    Radoslaw Karwowski

    University of Calgary, Canada

    1 publications · 107 citations

    1

    h-index

1–5 of 40

Venues

  1. Linguistics

    1 publications · 80 citations

    1

    h-index

  2. Functional Plant Biology

    1 publications · 193 citations

    1

    h-index

  3. Computers & Graphics

    1 publications · 21 citations

    1

    h-index

  4. Royal Society Open Science

    1 publications · 11 citations

    1

    h-index

  5. Applied Linguistics

    1 publications · 138 citations

    1

    h-index

1–5