Recursively Enumerable Languages

Recursively Enumerable Languages is a class of formal languages that comprises all languages for which there exists a Turing machine that halts and accepts every string in the language, while either rejecting or looping indefinitely on strings not in the language.

137

Publications

4.8K

Citations

173

Authors

99

Institutions

Publications per year

2017–2026

5

Variants

Semi-decidable LanguagesTuring-recognizable Languages

Authors

173

  1. GP
    Gheorghe Pǎun

    Romanian Academy, Romania

    11 publications · 511 citations

    11

    h-index

  2. AM
    Alexander Meduna

    Brno University of Technology, Czechia

    7 publications · 107 citations

    7

    h-index

  3. EC
    Erzsébet Csuhaj-Varjú

    Hungarian Academy of Sciences, Hungary

    6 publications · 199 citations

    6

    h-index

  4. CM
    Carlos Martı́n-Vide

    Universitat Rovira i Virgili, Spain

    5 publications · 167 citations

    5

    h-index

  5. RF
    Rudolf Freund

    TU Wien, Austria

    5 publications · 232 citations

    5

    h-index

1–5 of 173

Venues

  1. Theoretical Computer Science

    18 publications · 458 citations

    13

    h-index

  2. International Journal of Foundations of Computer Science

    IJFCS · 9 publications · 258 citations

    9

    h-index

  3. International Journal of Computer Mathematics

    9 publications · 178 citations

    9

    h-index

  4. Algebra and Logic

    5 publications · 93 citations

    5

    h-index

  5. Annals of Pure and Applied Logic

    4 publications · 63 citations

    4

    h-index

1–5