Language Generating Systems

Language Generating Systems is a formal framework within theoretical computer science that generates syntactically structured strings over an alphabet according to precisely defined rules, distinguishing itself from other language models by its emphasis on algorithmic mechanisms for deriving sequences in recursively enumerable languages.

145

Publications

4.8K

Citations

323

Authors

148

Institutions

Publications per year

2017–2026

16

Authors

323

  1. LP
    Linqiang Pan

    Huazhong University of Science and Technology, China

    4 publications · 168 citations

    4

    h-index

  2. HB
    Henning Bordihn

    University of Potsdam, Germany

    3 publications · 48 citations

    3

    h-index

  3. CM
    Chris Mellish

    University of Aberdeen, United Kingdom

    3 publications · 51 citations

    3

    h-index

  4. GP
    Gheorghe Pǎun

    Romanian Academy, Romania

    3 publications · 226 citations

    3

    h-index

  5. DS
    Daniel S. Paiva

    University of Brighton, United Kingdom

    3 publications · 47 citations

    3

    h-index

1–5 of 323

Venues

  1. Theoretical Computer Science

    8 publications · 151 citations

    8

    h-index

  2. International Journal of Computer Mathematics

    7 publications · 153 citations

    7

    h-index

  3. International Journal of Foundations of Computer Science

    IJFCS · 4 publications · 101 citations

    4

    h-index

  4. Communications of the ACM

    3 publications · 80 citations

    3

    h-index

  5. ArXiv.org

    Repository · 3 publications · 32 citations

    3

    h-index

1–5