String Rewriting Systems

String Rewriting System is a formal language mechanism consisting of a set of string rewriting rules that specify deterministic or nondeterministic transformations of strings by replacing substrings according to defined pattern-to-replacement mappings.

55

Publications

2.8K

Citations

81

Authors

57

Institutions

Publications per year

2017–2026

2

Authors

81

  1. FO
    Friedrich Otto

    University of Kassel, Germany

    7 publications · 134 citations

    7

    h-index

  2. JW
    Johannes Waldmann

    Leipzig University of Applied Sciences, Germany

    4 publications · 122 citations

    4

    h-index

  3. MK
    Masashi Katsura

    Kyoto Sangyo University, Japan

    3 publications · 38 citations

    3

    h-index

  4. AG
    Alfons Geser

    Leipzig University of Applied Sciences, Germany

    3 publications · 95 citations

    3

    h-index

  5. MS
    Mads Sig Ager

    Aarhus University, Denmark

    3 publications · 72 citations

    3

    h-index

1–5 of 81

Venues

  1. Theoretical Computer Science

    8 publications · 315 citations

    8

    h-index

  2. 2

    h-index

  3. Journal of Symbolic Computation

    2 publications · 26 citations

    2

    h-index

  4. Fundamenta Informaticae

    2 publications · 100 citations

    2

    h-index

  5. Information Sciences

    2 publications · 31 citations

    2

    h-index

1–5